344 research outputs found
Cato der Ältere über das Alter : Lateinisch - deutsch /
No full textgedanken von zeitloser Aktualität werden in den Dialogen über das Alter ("Cato") und die Freundschaft ("Laelius") berühmten Persönlichkeiten aus Roms großer Vergangenheit in den Mund gelegt. Die kleinen Schriften sind mit ihrer vollendeten Sprache wahre Perlen im philosophischen Werk Ciceros. Herausgegeben von M. Faltner, mit einer Einführung von G. Fink.gedanken von zeitloser Aktualität werden in den Dialogen über das Alter ("Cato") und die Freundschaft ("Laelius") berühmten Persönlichkeiten aus Roms großer Vergangenheit in den Mund gelegt. Die kleinen Schriften sind mit ihrer vollendeten Sprache wahre Perlen im philosophischen Werk Ciceros. Herausgegeben von M. Faltner, mit einer Einführung von G. Fink.Electronic reproduction.Mode of access: Internet via World Wide Web.Description based on online resource; title from PDF title page (publisher’s Web site, viewed May 26, 2011
De Max-Planck medaille
No full textDe Max-Planck-Medaille is een onderscheiding die sinds 1929 jaarlijks wordt uitgereikt door de toentertijd grootste vereniging van natuurkundigen ter wereld: de Deutsche Physikalische Gesellschaft. Het is als het ware de Nobelprijs voor de theoretische natuurkunde, volgens de natuurkundigen zelf. In 1962 werd deze prestigieuze prijs toegekend aan de Delftse hoogleraar in de theoretische natuurkunde, tevens Rector Magnificus van de TH Delft: Ralph Kronig (1904-1995). De medaille is, samen met een klein persoonlijk archief, in 2016 door de familie geschonken aan de TU Delft.Library Research Service
Receding-horizon control for max-plus linear systems with discrete actions using optimistic planning
No full textThis paper addresses the infinite-horizon optimal control problem for max-plus linear systems where the considered objective function is a sum of discounted stage costs over an infinite horizon. The minimization problem of the cost function is equivalently transformed into a maximization problem of a reward function. The resulting optimal control problem is solved based on an optimistic planning algorithm. The control variables are the increments of system inputs and the action space is discretized as a finite set. Given a finite computational budget, a control sequence is returned by the optimistic planning algorithm. The first control action or a subsequence of the returned control sequence is applied to the system and then a receding-horizon scheme is adopted. The proposed optimistic planning approach allows us to limit the computational budget and also yields a characterization of the level of near-optimality of the resulting solution. The effectiveness of the approach is illustrated with a numerical example. The results show that the optimistic planning approach results in a lower tracking error compared with a finite-horizon approach when a subsequence of the returned control sequence is applied.Accepted Author ManuscriptTeam Bart De Schutte
Performance study of single-query motion planning for grasp execution using various manipulators
No full textThis paper identifies high performing motion planners among three manipulators when carrying out grasp executions. Simultaneously, this paper presents useful benchmarking data. Sampling-based motion planners of OMPL available for use in MoveIt! are compared by performing several grasping-related motion planning problems. The performance of the planners is measured by means of solved runs, computing time and path length. Based on the results, recommendations are made for planner choice that shows high performance for the used manipulators.Accepted Author ManuscriptRobot Dynamic
Min-max control of fuel-cell-car-based smart energy systems
No full textRecently, the idea of using fuel cell vehicles as the future way of producing electricity has emerged. A fuel cell car has all the necessary devices on board to convert the chemical energy of hydrogen into electricity. This paper considers a scenario where a parking lot for fuel cell cars acts as a virtual power plant. In order to describe the system behavior from the energy point of view, a hybrid (mixed logical dynamical) model is constructed. With this model, a control system is designed to determine the production profile for both the fuel cell and battery of each car in the parking lot subject to minimizing the operational cost. In order to deal with both the uncertainty in the demand profile and the power balance constraint, a robust min-max model predictive control algorithm is developed. The effectiveness of the proposed approach is illustrated in a numerical example.Accepted Author ManuscriptTeam Bart De Schutte
A Quantum Annealing Approach for Solving Hard Variants of the Stable Marriage Problem
No full textThe Stable Marriage Problem (SMP) describes the problem, of finding a stable matching between two equally sized sets of elements (e.g., males and females) given an ordering of preferences for each element. A matching is stable, when there does not exist any match of a male and female which both prefer each other to their current partner under the matching. Finding such a matching of maximum cardinality, when ties and incomplete preference lists are allowed, is called MAX-SMTI and is an NP-hard variation of the SMP. In this work a Quadratic Unconstrained Binary Optimization (QUBO) formulation for MAX-SMTI is introduced and solved both with D-Wave Systems quantum annealing hardware and by their classical meta-heuristic QBSolv. Both approaches are reviewed against existing state-of-the-art approximation algorithms for MAX-SMTI. Additionally, the proposed QUBO problem can also be used to count stable matchings in SMP instances, which is proven to be a #P-complete problem. The results show, that the proposed (quantum) methods can compete with the classical ones regarding the solution quality and might be a relevant alternative, when quantum hardware scales with respect to the number of qubits and their connectivity.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Quantum & Computer EngineeringQuantum Circuit Architectures and Technolog
Online identification of continuous bimodal and trimodal piecewise affine systems
No full textThis paper investigates the identification of continuous piecewise affine systems in state space form with jointly unknown partition and subsystem matrices. The partition of the system is generated by the so-called centers. By representing continuous piecewise affine systems in the max-form and using a recursive Gauss-Newton algorithm for a suitable cost function, we derive adaptive laws to online estimate parameters including both subsystem matrices and centers. The effectiveness of the proposed approach is demonstrated with a numerical example.Accepted Author ManuscriptTeam Bart De Schutte
Editor and Author: Review of \u3ci\u3eMax and Marjorie: The Correspondence between Maxwell E. Perkim & Marjorie Kinnan Rawlings\u3c/i\u3e. Rodger L. Tarr, ed.
No full textMax & Marjorie, the complete correspondence between America\u27s best-known book editor and one of his best-known authors, will please several groups of readers. For literary scholars, it is a useful addition to the earlier editions of Maxwell Perkins\u27s correspondence. Historians of publishing will appreciate insights into book promotion, magazine publication, and other business issues that are extensively discussed. The many readers who have enjoyed The Yearling will have the opportunity to get to know its author. Eminently readable, the edition should reach a large audience beyond academe. Its broad appeal presented the editor, Rodger Tarr, with an enormous challenge, a challenge most evident in the annotation.
NEH Announces Award
The Share-A-Ride Problem with Integrated Routing and Design Decisions: The Case of Mixed-Purpose Shared Autonomous Vehicles
No full textThe shared autonomous vehicle (SAV) is a new concept that meets the upcoming trends of autonomous driving and changing demands in urban transportation. SAVs can carry passengers and parcels simultaneously, making use of dedicated passenger and parcel modules on board. A fleet of SAVs could partly take over private transport, taxi, and last-mile delivery services. A reduced fleet size compared to conventional transportation modes would lead to less traffic congestion in urban centres. This paper presents a method to estimate the optimal capacity for the passenger and parcel compartments of SAVs. The problem is presented as a vehicle routing problem and is named variable capacity share-a-ride-problem (VCSARP). The model has a MILP formulation and is solved using a commercial solver. It seeks to create the optimal routing schedule between a randomly generated set of pick-up and drop-off requests of passengers and parcels. The objective function aims to minimize the total energy costs of each schedule, which is a trade-off between travelled distance and vehicle capacity. Different scenarios are composed by altering parameters, representing travel demand at different times of the day. The model results show the optimized cost of each simulation along with associated routes and vehicle capacities.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Transport Engineering and Logistic
- …
