EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Multi-flying Cars Path Planning Strategy Considering Energy Consumption and Time in Urban Environments

Tao Deng, Jifa Yan, Binhao Xu

Automotive Innovation · 2025-02 · 8 (1) · 92-112

DOI: 10.1007/s42154-024-00312-0 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Automotive Innovation, online erschienen am 08.03.2025. Verfasst von Tao Deng und 2 weiteren Autor:innen. Die Arbeit wurde bisher 3-mal zitiert (Crossref) und nennt 46 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Natural Science Foundation of China, Natural Science Ranking Projects of Chongqing Jiaotong University, Team Building Project for Graduate Tutors in Chongqing.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

A new type of transportation vehicle, the flying car, is attracting increasing attention in the automotive and aviation industries to meet people’s personalized transportation needs for urban air traffic and future travel. With its vertical take-off and landing capability, flying cars can expand its feasible routes into 3D space. The above process, however, requires sufficient path planning to obtain optimal 3D path. To solve the above issue, the inspiration was drawn from animals in the natural world to design a type of flying car that can travel in various urban environments such as land and low altitude by using different components like wheels and propellers. Incorporating the motion characteristics of flying cars in the future urban environment, segmenting the energy consumption and time models of various stages of flying cars is conducted. The introduction of temporal A* algorithm into the new field of flying cars for the first time, the priority planning algorithm for multiple flying car groups based on an improved A* algorithm utilizing safety intervals is proposed. The proposed strategy is validated on different sizes of urban environment maps. The results indicate that on a complex map with 452 nodes, the strategy effectively reduces distance by 4.5 m, decreases energy consumption by 85.8% and improves planning speed. Compared with the strategy based on multi-commodity network flow integer linear programming, the planning results are roughly the same, but the weighted cost of employing this strategy is decreased by 5.2%, and the path distance is reduced by 0.34 m.

Förderung

  • National Natural Science Foundation of China
  • Natural Science Ranking Projects of Chongqing Jiaotong University
  • Team Building Project for Graduate Tutors in Chongqing
  • Joint Training Base Construction Project for Graduate Students in Chongqing

Zitieren

APA

Deng, T., Yan, J., & Xu, B. (2025). Multi-flying Cars Path Planning Strategy Considering Energy Consumption and Time in Urban Environments. Automotive Innovation, 8(1), 92-112. https://doi.org/10.1007/s42154-024-00312-0

Vancouver

Deng T, Yan J, Xu B. Multi-flying Cars Path Planning Strategy Considering Energy Consumption and Time in Urban Environments. Automotive Innovation. 2025;8(1):92-112. doi:10.1007/s42154-024-00312-0

BibTeX
@article{Deng2025,
  author = {Deng, Tao and Yan, Jifa and Xu, Binhao},
  title = {Multi-flying Cars Path Planning Strategy Considering Energy Consumption and Time in Urban Environments},
  journal = {Automotive Innovation},
  year = {2025},
  volume = {8},
  number = {1},
  pages = {92--112},
  doi = {10.1007/s42154-024-00312-0}
}
Kostenlos starten →