This paper presents a contribution to the problem of obtaining an optimal synthesis for shortest paths for a unicycle guided by an on–board limited Field Of–View (FOV) sensor, which must keep a given landmark in sight. Previous works on this subject have provided an optimal synthesis for the case in which the FOV is limited in the horizontal directions (H– FOV, i.e. left and right boundaries). In this paper we study the complementary case in which the FOV is limited only in the vertical direction (V–FOV, i.e. upper and lower boundaries). With respect to the H–FOV case, the vertical limitation is all but a simple extension. Indeed, not only the geometry of extremal arcs is different, but also a more complex structure of the synthesis is revealed by analysis. We will indeed show that there exist initial configurations for which the optimal path does not exist. In such cases, we provide an e–optimal path whose length approximates arbitrarily well any other shorter path. Finally, we provide a partition of the motion plane in regions such that the optimal or e–optimal path from each point in that region is univocally determined.

10aEmbedded Control10aRobotics1 aSalaris, P.1 aCristofaro, A.1 aPallottino, L.1 aBicchi, A. uhttps://www.centropiaggio.unipi.it/publications/epsilon%E2%80%93optimal-synthesis-vehicles-vertically-bounded-field-view.html02070nas a2200205 4500008003900000020002200039245009600061210006900157260004300226300001600269520139100285653002101676653001301697100001901710700001601729700001901745700001701764700001501781856006801796 2014 d a978-1-4799-7746-800aOn Time-Optimal Trajectories for Differential Drive Vehicles with Field-Of-View Constraints0 aTimeOptimal Trajectories for Differential Drive Vehicles with Fi aLos Angeles, USA, December 15-17bIEEE a2191 - 21973 aThis paper presents the first step toward the study of minimum time trajectories for a differential drive robot, which is equipped with a fixed and limited Field-Of-View (FOV) camera, towards a desired configuration while keeping a given landmark in sight during maneuvers. While several previous works have provided a complete synthesis of shortest paths in case of both nonholonomic and FOV constraints, to the best of our knowledge, this paper represents the first analysis of minimum time trajectories with the two constraints. After showing the extremals of the problem at hand, i.e. straight lines, rotations on the spot, logarithmic spirals and involute of circles, we provide the optimal control laws that steer the vehicle along the path and the cost in terms of time along each extremal. Moreover, we compare some concatenations of extremals in order to reduce the complexity of the problem toward the definition of a sufficient finite set of optimal maneuvers.

10aEmbedded Control10aRobotics1 aCristofaro, A.1 aSalaris, P.1 aPallottino, L.1 aGiannoni, F.1 aBicchi, A. uhttp://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=7039723