Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Path Planning Algorithms for a Car-Like Robot visiting a set of
  Waypoints with Field of View Constraints   This article considers two variants of a shortest path problem for a car-like
robot visiting a set of waypoints. The sequence of waypoints to be visited is
specified in the first variant while the robot is allowed to visit the
waypoints in any sequence in the second variant. Field of view constraints are
also placed when the robot arrives at a waypoint, i.e., the orientation of the
robot at any waypoint is restricted to belong to a given interval of angles at
the waypoint. The shortest path problem is first solved for two waypoints with
the field of view constraints using Pontryagin's minimum principle. Using the
results for the two point problem, tight lower and upper bounds on the length
of the shortest path are developed for visiting n points by relaxing the
requirement that the arrival angle must be equal to the departure angle of the
robot at each waypoint. Theoretical bounds are also provided on the length of
the feasible solutions obtained by the proposed algorithm. Simulation results
verify the performance of the bounds for instances with 20 waypoints.

13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
34
The categories of this paper are: chem-ph
19
The categories of this paper are: eess
16
The categories of this paper are: stat
36
The categories of this paper are: cmp-lg
2
The categories of this paper are: math
17
The categories of this paper are: q-fin
18
The categories of this paper are: econ
25
The categories of this paper are: patt-sol
28
The categories of this paper are: alg-geom
11
The categories of this paper are: hep-lat
15
The categories of this paper are: nucl-ex
6
The categories of this paper are: astro-ph
9
The categories of this paper are: nlin
10
The categories of this paper are: q-bio