Solution Algorithms for the Bounded Acceleration Shortest Path Problem

被引：1

作者：

Ardizzoni, Stefano ^{[1
]}

Consolini, Luca ^{[1
]}

Laurini, Mattia ^{[1
]}

Locatelli, Marco ^{[1
]}

机构：

[1] Univ Parma, Dipartimento Ingn & Architettura, I-43124 Parma, Italy

来源：

IEEE TRANSACTIONS ON AUTOMATIC CONTROL | 2023年 / 68卷 / 03期

关键词：

Complexity theory; Shortest path problem; Accelerated aging; Planning; Costs; Ions; Autonomous vehicles; motion planning; numerical simulations; shortest path problem;

D O I：

10.1109/TAC.2022.3172169

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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.

引用

页码：1910 / 1917

页数：8

共 50 条

[21] An improved solution algorithm for the constrained shortest path problem
Santos, Luis
Coutinho-Rodrigues, Joao
Current, John R.
[J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2007, 41 (07) : 756 - 771
[22] An approximate solution of a variational problem by the shortest path method
Lotarev, DT
[J]. AUTOMATION AND REMOTE CONTROL, 2002, 63 (09) : 1406 - 1409
[23] A distributed solution to the shortest path problem for large networks
Li, XF
[J]. 6TH WORLD MULTICONFERENCE ON SYSTEMICS, CYBERNETICS AND INFORMATICS, VOL V, PROCEEDINGS: COMPUTER SCI I, 2002, : 57 - 62
[24] The CNN solution to the shortest-path-finder problem
Muñuzuri, Alberto P.
Vazquez-Otero, Alejandro
[J]. 2008 11TH INTERNATIONAL WORKSHOP ON CELLULAR NEURAL NETWORKS AND THEIR APPLICATIONS, 2008, : 248 - 251
[25] Fully dynamic output bounded single source shortest path problem
Frigioni, D
MarchettiSpaccamela, A
Nanni, U
[J]. PROCEEDINGS OF THE SEVENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 1996, : 212 - 221
[26] Distributed algorithms from arboreal ants for the shortest path problem
Garg, Shivam
Shiragur, Kirankumar
Gordon, Deborah M.
Charikar, Moses
[J]. PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 2023, 120 (06)
[27] Comparison of the Exact and Approximate Algorithms in the Random Shortest Path Problem
Czekaj, Jacek
Socha, Leslaw
[J]. SYSTEM MODELING AND OPTIMIZATION, 2009, 312 : 220 - +
[28] Generalized path-finding algorithms on semirings and the fuzzy shortest path problem
Boulmakoul, A
[J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 2004, 162 (01) : 263 - 272
[29] Subcubic Cost Algorithms for the All Pairs Shortest Path Problem
T. Takaoka
[J]. Algorithmica, 1998, 20 : 309 - 318
[30] TWO-PHASE ALGORITHMS FOR THE PARAMETRIC SHORTEST PATH PROBLEM
Chakraborty, Sourav
Fischer, Eldar
Lachish, Oded
Yuster, Raphael
[J]. 27TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2010), 2010, 5 : 167 - 178

← 1 2 3 4 5 →