A Multi-Vehicle Formation Path Planning Method in Urban Environments Based on Multi-Objective Optimization

This paper addresses the ground path navigation problem for army combat forces in urban environments and proposes an improved NSGA-II algorithm based on multiobjective optimization to solve the path planning of multiple vehicles with different weights and formations in complex road networks. The proposed method considers various constraints, including road segment load limits, height restrictions, turning radius, and traffic flow. By optimizing path length, travel time, and solution feasibility, it achieves a balance among multiple objectives. Compared with traditional NSGA-II, genetic algorithm, simulated annealing algorithm, and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{A}^{*}$</tex> algorithm, the improved NSGA-II algorithm demonstrates significant advantages in terms of path quality and solution diversity. Simulation experiments validate the algorithm's effectiveness in practical applications, and the results show that the improved NSGA-II algorithm can provide high-quality path solutions under multi-objective and multi-constraint conditions, meeting the operational needs of complex urban environments.

Authors

Institutions

Publication Details

Published
2025-06-06
DOI
https://doi.org/10.1109/dlcv65218.2025.11088827
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Multi-Vehicle Formation Path Planning Method in Urban Environments Based on Multi-Objective Optimization

Zeyu Li, Dong Sheng Li, Anxian Lu, Ruilin Chai
Robotic Path Planning Algorithms
article

A Multi-Vehicle Formation Path Planning Method in Urban Environments Based on Multi-Objective Optimization

Zeyu Li, Dong Sheng Li, Anxian Lu, Ruilin Chai
article en

Abstract

This paper addresses the ground path navigation problem for army combat forces in urban environments and proposes an improved NSGA-II algorithm based on multiobjective optimization to solve the path planning of multiple vehicles with different weights and formations in complex road networks. The proposed method considers various constraints, including road segment load limits, height restrictions, turning radius, and traffic flow. By optimizing path length, travel time, and solution feasibility, it achieves a balance among multiple objectives. Compared with traditional NSGA-II, genetic algorithm, simulated annealing algorithm, and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\mathrm{A}^{*}$</tex> algorithm, the improved NSGA-II algorithm demonstrates significant advantages in terms of path quality and solution diversity. Simulation experiments validate the algorithm's effectiveness in practical applications, and the results show that the improved NSGA-II algorithm can provide high-quality path solutions under multi-objective and multi-constraint conditions, meeting the operational needs of complex urban environments.

Nanjing Institute of Technology (CN), Institute of Electronics (CN)
Sustainable cities and communities
Openalex Percentile: Top 81%
Robotic Path Planning Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.