.png){kind=icon}
返回
Solution Algorithms for the Bounded Acceleration Shortest Path Problem
.png){kind=icon}
OA
AI
DOI：10.1109/TAC.2022.3172169.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The purpose of this article is to introduce and characterize the bounded acceleration shortest path problem (BASP), a generalization of the shortest path problem (SP). This problem is associated to a graph: nodes represent positions of a mobile vehicle and arcs are associated to preassigned geometric paths that connect these positions. The BASP consists in finding the minimum-time path between two nodes. Differently from the SP, the vehicle has to satisfy bounds on maximum and minimum acceleration and speed, which depend on the vehicle's position on the currently traveled arc. Even if the BASP is NP-hard in the general case, we present a solution algorithm that achieves polynomial time-complexity under some additional hypotheses on problem data.
Keyword:
Complexity theory
Shortest path problem
Accelerated aging
Planning
Costs
Ions
Autonomous vehicles
motion planning
numerical simulations
shortest path problem
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容