The Bounded Acceleration Shortest Path problem: complexity and solution algorithms

03/04/2021
by   Stefano Ardizzoni, et al.
0

The purpose of this work is to introduce and characterize the Bounded Acceleration Shortest Path (BASP) problem, a generalization of the Shortest Path (SP) problem. This problem is associated to a graph: the nodes represent positions of a mobile vehicle and the arcs are associated to pre-assigned geometric paths that connect these positions. BASP consists in finding the minimum-time path between two nodes. Differently from SP, we require that the vehicle satisfy bounds on maximum and minimum acceleration and speed, that depend on the vehicle position on the currently traveled arc. We prove that BASP is NP-hard and define solution algorithm that achieves polynomial time-complexity under some additional hypotheses on problem data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2023

Solving the recoverable robust shortest path problem in DAGs

This paper deals with the recoverable robust shortest path problem under...
research
07/10/2020

Approximate Time-Optimal Trajectories for Damped Double Integrator in 2D Obstacle Environments under Bounded Inputs

This article provides extensions to existing path-velocity decomposition...
research
09/13/2023

OrdinalFix: Fixing Compilation Errors via Shortest-Path CFL Reachability

The development of correct and efficient software can be hindered by com...
research
02/18/2019

Geometric secluded paths and planar satisfiability

We consider paths with low "exposure" to a polygonal domain, i.e., paths...
research
02/03/2020

WiSM: Windowing Surrogate Model for Evaluation of Curvature-Constrained Tours with Dubins vehicle

Dubins tours represent a solution of the Dubins Traveling Salesman Probl...
research
09/18/2020

Length-Bounded Paths Interdiction in Continuous Domain for Network Performance Assessment

Studying on networked systems, in which a communication between nodes is...
research
04/08/2022

Finding shortest and nearly shortest path nodes in large substantially incomplete networks

Dynamic processes on networks, be it information transfer in the Interne...

Please sign up or login with your details

Forgot password? Click here to reset