Planning with differential constraints for LAGR Paul Vernaza.

Slides:



Advertisements
Similar presentations
Yinghui Wu, LFCS DB talk Database Group Meeting Talk Yinghui Wu 10/11/ Simulation Revised for Graph Pattern Matching.
Advertisements

Motion Planning for Point Robots CS 659 Kris Hauser.
Probabilistic Path Planner by Someshwar Marepalli Pratik Desai Ashutosh Sahu Gaurav jain.
Emilio Frazzoli, Munther A. Dahleh and Eric Feron Jingru Luo.
Starting Talk Moves May Have Been A Little Awkward, but not as awkward as…
School of Systems, Engineering, University of Reading rkala.99k.org April, 2013 Motion Planning for Multiple Autonomous Vehicles Rahul Kala Literature.
The Vector Field Histogram Erick Tryzelaar November 14, 2001 Robotic Motion Planning A Method Developed by J. Borenstein and Y. Koren.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: The FIR Adaptive Filter The LMS Adaptive Filter Stability and Convergence.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Reciprocal Velocity Obstacles for Real-Time Multi-Agent Navigation Jur van den Berg Ming Lin Dinesh Manocha.
Situational Planning for the MIT DARPA Challenge Vehicle Thomas Coffee Image Credit: David Moore et al.
Motion planning, control and obstacle avoidance D. Calisi.
DESIGN OF A GENERIC PATH PATH PLANNING SYSTEM AILAB Path Planning Workgroup.
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
EE631 Cooperating Autonomous Mobile Robots Lecture 5: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
CSC344: AI for Games Lecture 5 Advanced heuristic search Patrick Olivier
Temporally and Spatially Deconflicted Path Planning for Multiple Marine Vehicles A. Häusler 1, R. Ghabcheloo 2, A. Pascoal 1, A. Aguiar 1 I. Kaminer 3,
Presenter: Robin van Olst. Avneesh SudRussell Gayle Erik Andersen Stephen GuyMing Lin Dinesh Manocha.
Multiple Marine Vehile Deconflicted Path Planning with Currents and Communication Constraints A. Häusler 1, R. Ghabcheloo 2, A. Pascoal 1, A. Aguiar 1.
Paper by Kevin M.Lynch, Naoji Shiroma, Hirohiko Arai, and Kazuo Tanie
Methods For Nonlinear Least-Square Problems
1 of 10 April 25, 2001 Minimizing System Modification in an Incremental Design Approach Paul Pop, Petru Eles, Traian Pop, Zebo Peng Department of Computer.
CS 326 A: Motion Planning 2 Dynamic Constraints and Optimal Planning.
Optimizing Schedules for Prioritized Path Planning of Multi-Robot Systems Maren Bennewitz Wolfram Burgard Sebastian Thrun.
P. Ögren (KTH) N. Leonard (Princeton University)
CS 326A: Motion Planning Basic Motion Planning for a Point Robot.
Chapter 5: Path Planning Hadi Moradi. Motivation Need to choose a path for the end effector that avoids collisions and singularities Collisions are easy.
Motion Planning in Dynamic Environments Two Challenges for Optimal Path planning.
Network Formation Games. Netwok Formation Games NFGs model distinct ways in which selfish agents might create and evaluate networks We’ll see two models:
9/14/2015CS225B Kurt Konolige Locomotion of Wheeled Robots 3 wheels are sufficient and guarantee stability Differential drive (TurtleBot) Car drive (Ackerman.
Robotics Daniel Vasicek 2012/04/15.
Advanced Programming for 3D Applications CE Bob Hobbs Staffordshire university Human Motion Lecture 3.
© Manfred Huber Autonomous Robots Robot Path Planning.
REAL-TIME NAVIGATION OF INDEPENDENT AGENTS USING ADAPTIVE ROADMAPS Avneesh Sud 1, Russell Gayle 2, Erik Andersen 2, Stephen Guy 2, Ming Lin 2, Dinesh Manocha.
Economic Decisions Fri. September 2, Today’s Objectives  Distinguish the difference between wants and needs  Explain the difference between goods.
Robotics Chapter 5 – Path and Trajectory Planning
Path Planning for a Point Robot
PRE-DECISIONAL DRAFT; For planning and discussion purposes only 1 Mars Science Laboratory Rover Trajectory Planning Constrained Global Planning and Path.
Numerical Integration and Rigid Body Dynamics for Potential Field Planners David Johnson.
yG7s#t=15 yG7s#t=15.
UNC Chapel Hill M. C. Lin Introduction to Motion Planning Applications Overview of the Problem Basics – Planning for Point Robot –Visibility Graphs –Roadmap.
Local Search and Optimization Presented by Collin Kanaley.
Real-time motion planning for Manipulator based on Configuration Space Chen Keming Cis Peking University.
Laboratory of mechatronics and robotics Institute of solid mechanics, mechatronics and biomechanics, BUT & Institute of Thermomechanics, CAS Mechatronics,
City College of New York 1 John (Jizhong) Xiao Department of Electrical Engineering City College of New York Mobile Robot Control G3300:
Introduction to Robotics Tutorial 10 Technion, cs department, Introduction to Robotics Winter
Randomized Kinodynamics Planning Steven M. LaVelle and James J
Hydraulic and Electrical Power Design Decision Cynthia Perreira IMDL and SRL Dr. Book and Dr. Paredis February 21, 2003.
Occlusion Tracking Using Logical Models Summary. A Variational Partial Differential Equations based model is used for tracking objects under occlusions.
Randomized KinoDynamic Planning Steven LaValle James Kuffner.
Learning minimal representations for visual navigation Dr. William H. Warren Dept. of Cognitive & Linguistic Sciences Dr. Leslie Kaelbling Dept. of Computer.
Gaits Cost of Transportation Wheeled Mobile Robots Most popular locomotion mechanism Highly efficient Simple mechanical implementation Balancing is.
Rollover Avoidance System
O PTIMAL A CCELERATION -B OUNDED T RAJECTORY P LANNING IN D YNAMIC E NVIRONMENTS A LONG A S PECIFIED P ATH Jeff Johnson and Kris Hauser School of Informatics.
4/22/20031/28. 4/22/20031/28 Presentation Outline  Multiple Agents – An Introduction  How to build an ant robot  Self-Organization of Multiple Agents.
School of Computer Science & Engineering
Trajectory Generation
Date of download: 11/6/2017 Copyright © ASME. All rights reserved.
Schedule for next 2 weeks
Higher-Order Differential Equations
EE631 Cooperating Autonomous Mobile Robots Lecture: Collision Avoidance in Dynamic Environments Prof. Yi Guo ECE Dept.
Locomotion of Wheeled Robots
Path Planning in Discrete Sampled Space
Open Differentials By: Paul Decarolis
Visual servoing: a global path-planning approach
Path Planning in Discrete Sampled Space
Sudoku.
All pupils can recall information on real life graphs
Humanoid Motion Planning for Dual-Arm Manipulation and Re-Grasping Tasks Nikolaus Vahrenkamp, Dmitry Berenson, Tamim Asfour, James Kuffner, Rudiger Dillmann.
Planning.
What is this course about?
Presentation transcript:

Planning with differential constraints for LAGR Paul Vernaza

Problem definition Given an obstacle map, current position, goal position, plan a path to goal satisfying differential constraints Solution must operate in real-time Robot: wheeled, differential drive

Current approach Disadvantage: no consideration of dynamics Combination of A* and elastic band potential Advantage: speed

Investigated approaches Coupled approach: Incrementally build search graph from sampled controls, dynamics simulator Choose expansion points in A*-like manner Decoupled approach: Find collision-free path Track path via controller that satisfies differential constraints Advantages, disadvantages…

Decoupled path planning A* + elastic band: a little awkward Can we directly and efficiently minimize elastic potential? Possibly… Careful choice of obstacle potential “Simulated gradient descent” Alternatively, A* with roadmap

Path tracking with differential constraints Length-optimal vs. time-optimal Vehicle BVP solvers: Reeds-Shepp, Balkcom-Mason, Chitsaz-LaValle Too unrealistic? No acceleration… Other steering methods Learning a controller

Planned deliverables New path planning approach Path tracker with differential constraints Hopefully, trial on real robot