Hohmann, Nikolas (2025)
Three-dimensional Many-objective Path Planning and Traffic Network Optimization for Urban Air Mobility Applications Under Social Considerations.
Technische Universität Darmstadt
doi: 10.26083/tuprints-00028839
Dissertation, Erstveröffentlichung, Verlagsversion
Kurzbeschreibung (Abstract)
This dissertation proposes and investigates solution approaches to two problems in urban air mobility, considering the different perspectives of many stakeholders, including societal interests. The many-objective path planning problem seeks Pareto-optimal, three-dimensional, and smooth paths connecting two given locations in the city. The multi-objective traffic network optimization problem searches for Pareto-optimal and three-dimensional transportation networks that can be constructed from a given set of paths. Since this work also explicitly considers social objectives within these problems, it has both a societal and a practical relevance. This thesis analyzes both stated problems and proposes a new framework to solve the first problem efficiently. Then, it shows how the optimized paths can be combined into a three-dimensional traffic network. Afterward, this dissertation presents another new framework to optimize the obtained traffic network in terms of multiple objectives. It tests the influence of integrating social criteria on the economic costs of the networks obtained. Using geospatial data from four different cities, paths and networks were optimized to evaluate the efficiency of the path planning framework against current methods and to compare the network solutions with conventional strategies. The developed path planning framework showed a significant advantage over comparable approaches. When traffic networks were optimized, including social criteria, their social acceptance increased much more than the monetary costs. An essential finding of this work is that the many-objective path planning problem can be solved efficiently in the three-dimensional operation space by an intelligent combination of existing algorithms and the inclusion of three new algorithmic features. Beyond that, it is beneficial to integrate social criteria into optimization problems when the solutions obtained are the basis for decisions in the area of conflict between the economy and human welfare.
Typ des Eintrags: | Dissertation | ||||
---|---|---|---|---|---|
Erschienen: | 2025 | ||||
Autor(en): | Hohmann, Nikolas | ||||
Art des Eintrags: | Erstveröffentlichung | ||||
Titel: | Three-dimensional Many-objective Path Planning and Traffic Network Optimization for Urban Air Mobility Applications Under Social Considerations | ||||
Sprache: | Englisch | ||||
Referenten: | Adamy, Prof. Dr. Jürgen ; Sendhoff, Prof. Dr. Bernhard | ||||
Publikationsjahr: | 6 Januar 2025 | ||||
Ort: | Darmstadt | ||||
Kollation: | XVIII, 182 Seiten | ||||
Datum der mündlichen Prüfung: | 28 November 2024 | ||||
DOI: | 10.26083/tuprints-00028839 | ||||
URL / URN: | https://tuprints.ulb.tu-darmstadt.de/28839 | ||||
Kurzbeschreibung (Abstract): | This dissertation proposes and investigates solution approaches to two problems in urban air mobility, considering the different perspectives of many stakeholders, including societal interests. The many-objective path planning problem seeks Pareto-optimal, three-dimensional, and smooth paths connecting two given locations in the city. The multi-objective traffic network optimization problem searches for Pareto-optimal and three-dimensional transportation networks that can be constructed from a given set of paths. Since this work also explicitly considers social objectives within these problems, it has both a societal and a practical relevance. This thesis analyzes both stated problems and proposes a new framework to solve the first problem efficiently. Then, it shows how the optimized paths can be combined into a three-dimensional traffic network. Afterward, this dissertation presents another new framework to optimize the obtained traffic network in terms of multiple objectives. It tests the influence of integrating social criteria on the economic costs of the networks obtained. Using geospatial data from four different cities, paths and networks were optimized to evaluate the efficiency of the path planning framework against current methods and to compare the network solutions with conventional strategies. The developed path planning framework showed a significant advantage over comparable approaches. When traffic networks were optimized, including social criteria, their social acceptance increased much more than the monetary costs. An essential finding of this work is that the many-objective path planning problem can be solved efficiently in the three-dimensional operation space by an intelligent combination of existing algorithms and the inclusion of three new algorithmic features. Beyond that, it is beneficial to integrate social criteria into optimization problems when the solutions obtained are the basis for decisions in the area of conflict between the economy and human welfare. |
||||
Alternatives oder übersetztes Abstract: |
|
||||
Status: | Verlagsversion | ||||
URN: | urn:nbn:de:tuda-tuprints-288399 | ||||
Sachgruppe der Dewey Dezimalklassifikatin (DDC): | 000 Allgemeines, Informatik, Informationswissenschaft > 004 Informatik 500 Naturwissenschaften und Mathematik > 510 Mathematik 600 Technik, Medizin, angewandte Wissenschaften > 600 Technik 600 Technik, Medizin, angewandte Wissenschaften > 620 Ingenieurwissenschaften und Maschinenbau |
||||
Fachbereich(e)/-gebiet(e): | 18 Fachbereich Elektrotechnik und Informationstechnik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Automatisierungstechnik und Mechatronik 18 Fachbereich Elektrotechnik und Informationstechnik > Institut für Automatisierungstechnik und Mechatronik > Regelungsmethoden und Intelligente Systeme |
||||
Hinterlegungsdatum: | 06 Jan 2025 13:20 | ||||
Letzte Änderung: | 15 Jan 2025 13:16 | ||||
PPN: | |||||
Referenten: | Adamy, Prof. Dr. Jürgen ; Sendhoff, Prof. Dr. Bernhard | ||||
Datum der mündlichen Prüfung / Verteidigung / mdl. Prüfung: | 28 November 2024 | ||||
Export: | |||||
Suche nach Titel in: | TUfind oder in Google |
Frage zum Eintrag |
Optionen (nur für Redakteure)
Redaktionelle Details anzeigen |