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 条

[41] Solution algorithms for shortest path network interdiction with symmetric and asymmetric information
Azizi, Elnaz
Seifi, Abbas
[J]. INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE-OPERATIONS & LOGISTICS, 2023, 10 (01)
[42] Self-stabilizing algorithms for the shortest path problem in distributed systems
Huang, TC
Lin, JC
Mou, N
[J]. PARALLEL AND DISTRIBUTED COMPUTING SYSTEMS, 2004, : 270 - 277
[43] The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
Holzmann, Tim
Smith, J. Cole
[J]. OPERATIONS RESEARCH, 2021, 69 (01) : 82 - 99
[44] On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
Pinto, Leizer Lima
Pascoal, Marta M. B.
[J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (10) : 1774 - 1779
[45] Approximation algorithms for the shortest total path length spanning tree problem
Wu, BY
Chao, KM
Tang, CY
[J]. DISCRETE APPLIED MATHEMATICS, 2000, 105 (1-3) : 273 - 289
[46] Historic Algorithms Help Unlock Shortest-Path Problem Breakthrough
Edwards, Chris
[J]. COMMUNICATIONS OF THE ACM, 2023, 66 (09) : 10 - 12
[47] Solving Stochastic Shortest Distance Path Problem by Using Genetic Algorithms
Ahmadi, Ehsan
Suer, Gursel A.
Al-Ogaili, Farah
[J]. CYBER PHYSICAL SYSTEMS AND DEEP LEARNING, 2018, 140 : 79 - 86
[48] EFFICIENT DISTRIBUTED ALGORITHMS FOR TOPOLOGY CONTROL PROBLEM WITH SHORTEST PATH CONSTRAINTS
Willson, James K.
Gao, Xiaofeng
Qu, Zhonghua
Zhu, Yi
Li, Yingshu
Wu, Weili
[J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2009, 1 (04) : 437 - 461
[49] Reformulation and Solution Algorithms for Absolute and Percentile Robust Shortest Path Problems
Xing, Tao
Zhou, Xuesong
[J]. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2013, 14 (02) : 943 - 954
[50] On the robust shortest path problem
Yu, G
Yang, J
[J]. COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (06) : 457 - 468

← 1 2 3 4 5 →