a framework for multi vehicle navigation using feedback
play

A Framework for Multi-Vehicle Navigation using Feedback-Based Motion - PowerPoint PPT Presentation

A Framework for Multi-Vehicle Navigation using Feedback-Based Motion Primitives Marijan Vukosavljev, Zachary Kroeze, Mireille E. Broucke, and Angela P. Schoellig IROS, September 25, 2017 Motivation M. Vukosavljev, Z. Kroeze, M. E. Broucke, and


  1. A Framework for Multi-Vehicle Navigation using Feedback-Based Motion Primitives Marijan Vukosavljev, Zachary Kroeze, Mireille E. Broucke, and Angela P. Schoellig IROS, September 25, 2017

  2. Motivation M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 2

  3. Motivation Path planning and control in known environments obstacle goal M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 3

  4. Problem Statement Given : β€’ β€’ Example: two double dynamics 𝑦̇ = 𝑔 𝑦, 𝑣 , outputs 𝑧 = β„Ž 𝑦 , β€’ integrators, n = 4, p = 2 where 𝑦 ∈ ℝ , , 𝑧 ∈ ℝ - 𝑦̇ 4 = 𝑦 5 goal and obstacle sets in output space β€’ 𝑦̇ 5 = 𝑣 4 y ( t ) goal goal 𝑦̇ = 𝑔 𝑦, 𝑣 β€’ Find : feedback controller 𝑣 𝑦 and set of β€’ 𝑦̇ 6 = 𝑦 7 initial conditions π‘Œ / βŠ‚ ℝ , such that 𝑧(𝑒) 𝑦̇ 7 = 𝑣 5 eventually enters the goal set and always obstacle obstacle β€’ 8𝑧 4 = 𝑦 4 y 2 𝑧 = β„Ž(𝑦) avoids the obstacle set y 2 𝑧 5 = 𝑦 6 Can be posed as a reach-avoid problem for a β€’ control system y 1 y 1 M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 4

  5. Framework Features β€’ Feedback control Most related β€’ Wide range of initial conditions y ( t ) goal literature : β€’ Robust to disturbances β€’ Requires no explicit path Pappas β€’ Safety guarantees Kumar β€’ Simultaneous motion obstacle y 2 Belta β€’ Computational efficiency Frazzoli β€’ Symmetry β€’ Lower dimensional spaces y 1 β€’ Modularity M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 5

  6. Proposed Framework Partition of environment Path planning Output Product Given Automaton Automated Transition System Gridding p -dim of output motion capabilities Problem space in output space grid Data p outputs for multi-robot system Shortest path Maneuver Automaton y = h ( x ) algorithm Motion Primitives, m i obstacle and Hybrid goal regions Box size Control Strategy dynamics discrete maneuver plan x = f ( x, u ) Λ™ low-level control feedback control, u m i ( x ) Solution to problem Control design M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 6

  7. Maneuver Automaton β€’ Formally a hybrid system β€’ Hybrid state space: motion primitives and continuous state in ℝ , β€’ Edges: concatenation constraints between motion primitives β€’ Each motion primitives is implemented by a feedback controller over a designated subset in ℝ , Hold Forward Backward v 3 v 3 v 6 v 3 Οƒ + Οƒ 0 , Οƒ βˆ’ Οƒ 0 , Οƒ + Οƒ 0 x 2 v 2 v 5 v 2 v 5 v 2 v 5 x 1 Οƒ + Οƒ 0 Οƒ βˆ’ B H F Οƒ βˆ’ Οƒ 0 v 4 v 4 v 1 v 4 M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 7

  8. Maneuver Automaton - Design β€’ First focus on double integrator: 𝑦̇ 4 = 𝑦 5 , 𝑦̇ 5 = 𝑣 , with 𝑧 = 𝑦 4 Οƒ 0 , Οƒ βˆ’ Οƒ 0 , Οƒ + Οƒ 0 Output space Hold Forward Backward behaviour Οƒ + Οƒ 0 𝑧 B H F Hold Forward Backward Οƒ βˆ’ Οƒ 0 v 3 v 3 v 6 v 3 Backward Hold Forward State space Οƒ + behaviour x 2 Reach control v 2 v 5 v 2 v 5 v 2 v 5 𝑦 5 x 1 B. Roszak and M. E. Broucke, β€œNecessary and sufficient conditons for reachability on a Οƒ βˆ’ simplex,” 2006. 𝑦 4 v 4 v 4 v 1 v 4 M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 8

  9. Maneuver Automaton - Application β€’ Quadrocopter model reduces to double integrator in each positional direction β€’ For the multi-quadrocopter model, stack all the double integrators β€’ Choose Hold, Forward, and Backward in each output component β€’ For example, one quadrocopter with planar motion: 𝑧 5 𝑧 4 βœ“ β—† βœ“ β—† βœ“ β—† βœ“ β—† βœ“ β—† H F H F B 𝑧 5 H H F F H 𝑧 4 M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 9

  10. Control Policy on the Product Automaton βœ“ β—† βœ“ β—† βœ“ β—† βœ“ β—† F F F H H H H H βœ“ β—† βœ“ β—† βœ“ β—† F H H F F F βœ“ β—† H βœ“ β—† βœ“ β—† βœ“ β—† F F H F βœ“ β—† F F H F H y 2 y 2 βœ“ β—† βœ“ β—† βœ“ β—† βœ“ β—† F F F H F F F F y 1 y 1 M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 10

  11. Experimental Results M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 11

  12. Experimental Results - Nominal M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 12

  13. M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 13

  14. Conclusion β€’ Addressed a path planning and control problem in known environments as a reach- avoid problem y ( t ) goal β€’ Employed a modular framework consisting of an output space partition, low-level feedback controllers, and a high-level feedback for obstacle y 2 selecting motion primitives β€’ Highly robust control design that enables y 1 simultaneous motion in a computationally feasible way M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 14

  15. M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 15

  16. Comparison to Literature Paper Feedback control Simultaneous motion Computational efficiency Frazzoli, Dahleh, and Feron; 2005 Kloetzer and Belta; 2008 Fainekos, Girard, Kress-Gazit, Pappas; 2009 Ayanian, Kumar; 2010 Raman, Kress-Gazit; 2014 Vukosavljev, Kroeze, Broucke, Schoellig, 2017 M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 16

  17. Stack multiple copies 𝑦̇ 4 = 𝑦 5 𝑦̇ 5 = 𝑣 4 𝑦̇ = 𝑔 𝑦, 𝑣 𝑦̇ 6 = 𝑦 7 𝑦̇ 7 = 𝑣 5 8𝑧 4 = 𝑦 4 𝑧 = β„Ž(𝑦) 𝑧 5 = 𝑦 6 Lower dimensions Symmetry Modularity M. Vukosavljev, Z. Kroeze, M. E. Broucke, and A. P. Schoellig 17

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend