Optimal Synthesis of the Asymmetric Sinistral/Dextral Markov–Dubins Problem
We consider a variation of the classical Markov–Dubins problem dealing with curvature-constrained, shortest paths in the plane with prescribed initial and terminal positions and tangents, when the lower and upper bounds of the curvature of the path are not necessarily equal. The motivation for this problem stems from vehicle navigation applications, when a vehicle may be biased in taking turns at a particular direction due to hardware failures or environmental conditions. After formulating the shortest path problem as a minimum-time problem, a family of extremals, which is sufficient for optimality, is characterized, and subsequently the complete analytic solution of the optimal synthesis problem is presented. In addition, the synthesis problem, when the terminal tangent is free, is also considered, leading to the characterization of the set of points that can be reached in the plane by curves satisfying asymmetric curvature constraints.
KeywordsMarkov–Dubins problem Curvature constrained paths Asymmetric steering constraints Non-holonomic systems
Unable to display preview. Download preview PDF.
- 4.Isaacs, R.: Games of pursuit. RAND Report P-257. RAND Corporation, Santa Monica, CA (1951) Google Scholar
- 5.Isaacs, R.: Differential Games. A Mathematical Theory with Applications to Warfare and Pursuit, Control and Optimization. Dover, New York (1999) Google Scholar
- 8.Sussmann, H.J., Tang, G.: Shortest paths for the Reeds–Shepp car: A worked out example of the use of geometric techniques in nonlinear optimal control. Research Note SYCON-91-10, Rutgers University, New Brunswick, NJ (1991) Google Scholar
- 10.Boissonnat, J.D., Bui, X.-N.: Accessibility region for a car that only moves forward along optimal paths. Research Note 2181, Institut National de Recherche en Informatique et en Automatique, Sophia-Antipolis, France (1994) Google Scholar
- 11.Sussmann, H.J.: Shortest 3-dimensional path with a prescribed curvature bound. In: Proceedings of 34th IEEE Conference on Decision and Control, New Orleans, LA, December, pp. 3306–3312 (1995) Google Scholar
- 16.Sanfelice, R.G., Frazzoli, E.: On the optimality of Dubins paths across heterogeneous terrain. In: Proceedings of the 11th Intern. Workshop on Hybrid Systems, St. Louis, MO, April 22–24, pp. 457–470 (2008) Google Scholar
- 19.Bakolas, E., Tsiotras, P.: Time-optimal synthesis for the Zermelo–Markov–Dubins problem: The constant wind case. In: Proceedings of the 2010 American Control Conference, Baltimore, MD, June 10–12, pp. 6163–6163 (2010) Google Scholar
- 21.Merriam Webster Dictionary. http://www.merriam-webster.com/dictionary/
- 22.Bakolas, E., Tsiotras, P.: The asymmetric sinistral/dextral Markov–Dubins problem. In: Proceedings of the 48th IEEE Conference on Decision and Control, Shanghai, China, December 15–18, pp. 5649–5654 (2009) Google Scholar
- 23.Bui, X.-N., Boissonnat, J.D.: The shortest paths synthesis for nonholonomic robots moving forwards. Research Note 2153, Institut National de Recherche en Informatique et en Automatique, Sophia-Antipolis, France (1993) Google Scholar
- 24.Bui, X.-N., Souéres, P., Boissonnat, J.D., Laumond, J.-P.: Shortest path synthesis for Dubins nonholonomic robot. In: Proceedings of the 11th IEEE Intern. Conf. on Robotics and Automation, San Diego, California, May (1994) Google Scholar
- 26.Thomaschewski, B.: Dubins problem for the free terminal direction. Preprint (2001), pp. 1–14 Google Scholar