Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: The Bounded Acceleration Shortest Path problem: complexity and solution
  algorithms   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.

7
The categories of this paper are: hep-th
3
The categories of this paper are: physics
4
The categories of this paper are: cond-mat
37
The categories of this paper are: supr-con
22
The categories of this paper are: chao-dyn
33
The categories of this paper are: plasm-ph
17
The categories of this paper are: q-fin
35
The categories of this paper are: mtrl-th
0
The categories of this paper are: hep-ph
26
The categories of this paper are: bayes-an
20
The categories of this paper are: acc-phys
34
The categories of this paper are: chem-ph
36
The categories of this paper are: cmp-lg
32
The categories of this paper are: atom-ph
28
The categories of this paper are: alg-geom
23
The categories of this paper are: solv-int