On the Minimum-Time Control Problem for Differential Drive Robots with Bearing Constraints

Andrea Cristofaro (), Paolo Salaris (), Lucia Pallottino (), Fabio Giannoni () and Antonio Bicchi ()
Additional contact information
Andrea Cristofaro: University of Camerino
Paolo Salaris: Istitut National de Recherche en Informatique et en Automatique (INRIA)
Lucia Pallottino: University of Pisa
Fabio Giannoni: University of Camerino
Antonio Bicchi: University of Pisa

Journal of Optimization Theory and Applications, 2017, vol. 173, issue 3, No 13, 967-993

Abstract: Abstract This paper presents a study of analysis of minimum-time trajectories for a differential drive robot equipped with a fixed and limited field-of-view camera, which must keep a given landmark in view during maneuvers. Previous works have considered the same physical problem and provided a complete analysis/synthesis for the problem of determining the shortest paths. The main difference in the two cost functions (length vs. time) lays on the rotation on the spot. Indeed, this maneuver has zero cost in terms of length and hence leads to a 2D shortest path synthesis. On the other hand, in case of minimum time, the synthesis depends also on the orientations of the vehicle. In other words, the not zero cost of the rotation on the spot maneuvers leads to a 3D minimum-time synthesis. Moreover, the shortest paths have been obtained by exploiting the geometric properties of the extremal arcs, i.e., straight lines, rotations on the spot, logarithmic spirals and involute of circles. Conversely, in terms of time, even if the extremal arcs of the minimum-time control problem are exactly the same, the geometric properties of these arcs change, leading to a completely different analysis and characterization of optimal paths. In this paper, after proving the existence of optimal trajectories and showing the extremal arcs of the problem at hand, we provide the control laws that steer the vehicle along these arcs and the time-cost along each of them. Moreover, this being a crucial step toward numerical implementation, optimal trajectories are proved to be characterized by a finite number of switching points between different extremal arcs, i.e., the concatenations of extremal arcs with infinitely many junction times are shown to violate the optimality conditions.

Keywords: Time-optimal paths; Nonholonomic dynamical systems; Bearing constraints; Differential drive vehicles; 34H05; 37J60; 49J15; 93C85 (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-017-1110-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:173:y:2017:i:3:d:10.1007_s10957-017-1110-7

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-017-1110-7

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().