Search-Based Footstep Planning

Slides:



Advertisements
Similar presentations
BEST FIRST SEARCH - BeFS
Advertisements

Informed search algorithms
Informed search strategies
AI Pathfinding Representing the Search Space
An Introduction to Artificial Intelligence
A* Search. 2 Tree search algorithms Basic idea: Exploration of state space by generating successors of already-explored states (a.k.a.~expanding states).
Greedy best-first search Use the heuristic function to rank the nodes Search strategy –Expand node with lowest h-value Greedily trying to find the least-cost.
Solving Problem by Searching
NUS CS5247 Motion Planning for Camera Movements in Virtual Environments By Dennis Nieuwenhuisen and Mark H. Overmars In Proc. IEEE Int. Conf. on Robotics.
By Lydia E. Kavraki, Petr Svestka, Jean-Claude Latombe, Mark H. Overmars Emre Dirican
Anytime RRTs Dave Fergusson and Antony Stentz. RRT – Rapidly Exploring Random Trees Good at complex configuration spaces Efficient at providing “feasible”
Trade off between Exploration and Exploitation in Satisficing Planning Fan Xie.
CSC344: AI for Games Lecture 5 Advanced heuristic search Patrick Olivier
Nonholonomic Multibody Mobile Robots: Controllability and Motion Planning in the Presence of Obstacles (1991) Jerome Barraquand Jean-Claude Latombe.
MAE 552 – Heuristic Optimization Lecture 27 April 3, 2002
Trading optimality for speed…
Problem Solving and Search in AI Heuristic Search
CSC344: AI for Games Lecture 4: Informed search
Chapter 5.4 Artificial Intelligence: Pathfinding.
Informed Search Idea: be smart about what paths to try.
A Randomized Approach to Robot Path Planning Based on Lazy Evaluation Robert Bohlin, Lydia E. Kavraki (2001) Presented by: Robbie Paolini.
Chapter 5.4 Artificial Intelligence: Pathfinding.
Graphs II Robin Burke GAM 376. Admin Skip the Lua topic.
World space = physical space, contains robots and obstacles Configuration = set of independent parameters that characterizes the position of every point.
Gapped BLAST and PSI- BLAST: a new generation of protein database search programs By Stephen F. Altschul, Thomas L. Madden, Alejandro A. Schäffer, Jinghui.
How are things going? Core AI Problem Mobile robot path planning: identifying a trajectory that, when executed, will enable the robot to reach the goal.
Informed State Space Search Department of Computer Science & Engineering Indian Institute of Technology Kharagpur.
Exact methods for ALB ALB problem can be considered as a shortest path problem The complete graph need not be developed since one can stop as soon as in.
Informed search strategies Idea: give the algorithm “hints” about the desirability of different states – Use an evaluation function to rank nodes and select.
Review: Tree search Initialize the frontier using the starting state While the frontier is not empty – Choose a frontier node to expand according to search.
1 Motion Fuzzy Controller Structure(1/7) In this part, we start design the fuzzy logic controller aimed at producing the velocities of the robot right.
Slides by: Eric Ringger, adapted from slides by Stuart Russell of UC Berkeley. CS 312: Algorithm Design & Analysis Lecture #36: Best-first State- space.
Autonomous Robots Robot Path Planning (3) © Manfred Huber 2008.
A* optimality proof, cycle checking CPSC 322 – Search 5 Textbook § 3.6 and January 21, 2011 Taught by Mike Chiang.
CSCE 552 Spring 2010 AI (III) By Jijun Tang. A* Pathfinding Directed search algorithm used for finding an optimal path through the game world Used knowledge.
CSCE 552 Fall 2012 AI By Jijun Tang. Homework 3 List of AI techniques in games you have played; Select one game and discuss how AI enhances its game play.
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
Chapter 3.5 Heuristic Search. Learning Objectives Heuristic search strategies –Best-first search –A* algorithm Heuristic functions.
Dept. Computer Science, Korea Univ. Intelligent Information System Lab A I (Artificial Intelligence) Professor I. J. Chung.
Vision-Guided Humanoid Footstep Planning for Dynamic Environments
Review: Tree search Initialize the frontier using the starting state
Chapter 5.4 Artificial Intelligence: Pathfinding
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
CS 326A: Motion Planning Probabilistic Roadmaps for Path Planning in High-Dimensional Configuration Spaces (1996) L. Kavraki, P. Švestka, J.-C. Latombe,
Adversarial Search and Game Playing (Where making good decisions requires respecting your opponent) R&N: Chap. 6.
Heuristic Search A heuristic is a rule for choosing a branch in a state space search that will most likely lead to a problem solution Heuristics are used.
On Multi-Arm Manipulation Planning
Probabilistic Robotics
Informed Search and Exploration
Department of Computer Science
Chap 4: Searching Techniques Artificial Intelligence Dr.Hassan Al-Tarawneh.
Mathematics & Path Planning for Autonomous Mobile Robots
CSPs: Search and Arc Consistency Computer Science cpsc322, Lecture 12
Finding Heuristics Using Abstraction
CAP 5636 – Advanced Artificial Intelligence
Crowd Simulation (INFOMCRWS) - A* Search
A* Path Finding Ref: A-star tutorial.
EA C461 – Artificial Intelligence
Informed search algorithms
More on Search: A* and Optimization
Workshop: A* Search.
Introducing Underestimates
Chap 4: Searching Techniques
Announcements This Friday Project 1 due Talk by Jeniya Tabassum
Informed Search Idea: be smart about what paths to try.
CSCE 552 Spring 2009 AI (III) By Jijun Tang.
The Rich/Knight Implementation
Stefan Oßwald, Philipp Karkowski, Maren Bennewitz
Informed Search Idea: be smart about what paths to try.
The Rich/Knight Implementation
Presentation transcript:

Search-Based Footstep Planning Armin Hornung, Daniel Maier, Maren Bennewitz Presentation by Dominique Gordon

Introduction

Humanoid Robots vs. Wheeled Robots Step over obstacles Many degrees of freedom Not yet feasible to plan whole body motions in real world

Overview A* search algorithm wA* search algorithm ARA* search algorithm R* search algorithm Extensions to 3D Adaptive-Level-of-Detail Planning

Today! First evaluation of anytime search-based footstep planning over long distances!

Search-Based Footstep Planning

Robot’s State State s = (x, y, 𝛳) of stance foot Footstep action a = (∆x, ∆y, ∆𝛳) relative to stance foot Expanding a state s - determine all successor states s’ s’s checked for collisions and discarded if invalid

A* Search Expands states according to f(s) = g(s) + h(s) g(s) = actual cost of best path to current state h(s) = heuristic that estimates cost to final goal Heuristics must be ADMISSIBLE h(s) ≤ the actual cost

A* Search with SLD as Heuristic f(x) = 75 + 374 = 449 f(x) = 140 + 253 = 393 f(x) = 118 + 329 = 447

A* Search Results Randomized Method Finds optimal path Performance dependent on quality of the heuristic Slow Randomized Method Fast No guarantees on solution quality

Anytime Search-Based Footstep Planning

Weighted A* Search (wA*) Inflates h with a factor w≥1 w=1 is standard A* Finds paths faster, expands fewer states Bias towards states that are closer to goal Trades quality of solution for efficiency

wA* Search with SLD as Heuristic, w=10 f(x) = 75 + 10(374) = 3815 f(x) = 140 + 10(253) = 2670 f(x) = 118 + 10(329) = 3408

Anytime Repairing A* (ARA*) Series of wA* searches while reusing previous information Initially large w As time allows, search runs with lower values of w With enough time, ARA* reaches w = 1 Cost of best solution is guaranteed no worse than w times optimal solution speedup is achieved by not re-computing the state values that have been correctly computed in the previous iterations

Anytime Repairing A* (ARA*) explained A* searches with decreasing w. w = 2.5 w = 1.5 w =1 The corresponding ARA* search iterations. w = 2.5 w = 1.5 w =1

ARA* Results Still depends on quality of heuristic Heuristic of euclidean distance create local minima around obstacles Heuristic of 2D Dijkstra path potentially inadmissible because no stepover

Randomized A* Search (R*) Depends less on quality of heuristic Series of short-range wA* searches Generates k successor states at distance ∆ in random direction Goal states within ∆ is added to successors as well Collision checked Finds “easy” local path - least number of expansions If requires too many expansions, marked AVOID Iteratively lowers w as time permits In our experiments, we used a threshold of 100 expansions to detect that a path can not be found easily

R* explained by me K = 4, ∆ = 1, w = 1 (for demo purposes) Heuristic is SLD ∆=1 g(S2)=5 ∆=1 g(S1)=7 S2 h(S2)=4 S1 S3 h(S3)=3 h(S1)=5 Goal ∆=1 g(S3)=5 Start h(S4)=3.5 ∆=1 g(S4)=3 S4 f(S1) = 7 + 5 = 12 f(S2) = 5 +4 = 9 f(S3) = 5 +3 = 8 f(S4) = 3 + 3.5 = 6.5 At every iteration, R* selects the next state s to expand from While normal A* expands s by generating all the immediate successors of state s, R* expands s by generating K states Only looks at 4 states -- so fast!

R* with Euclidean distance heuristic

ARA* vs. R* Experiments ARA* with 2D Dijkstra heuristic expands non-optimal path Inadmissible ARA* with Euclidean distance heuristic fails to find a plan in time R* with Euclidean finds good initial solutions quickly

Extensions to 3D 3D sensing builds elevation map Footstep state now also has height Body of robot collision-checked against environment to execute step Non-traversable if obstacle exceeds the max step height Extended Dijkstra heuristic

https://www.youtube.com/watch?v=g2NZ_EasJv0&feature=youtu.be

Adaptive-Level-of-Detail Planning

Large open spaces with no obstacles Close to obstacles 2D path easy to compute Easy for humanoid to follow with corresponding walking controller Close to obstacles Footstep planning allows robots to step close to or over obstacles More efficient than 2D path

fast 2D planning in open spaces Adaptive-Level-of-Detail planning combines fast 2D planning in open spaces with footstep planning in areas with obstacles

Preprocessing: Classify the environment open area vs. close to obstacles traversable vs. non traversable obstacles

Execution of Adaptive-Level-of-Detail Planning A walking controller to execute planned footsteps A velocity controller to follow the 2D path

Experiments with Adaptive-Level-of-Detail Planning 2D-only path = fastest computation, not optimal Global footstep plan = longest to compute, efficient path Adaptive-Level-of-Detail planning combines benefits Footstep planning only invoked where necessary Path costs 2% higher than optimal, 51% lower than 2D

Summary Anytime algorithms ARA* R* 3D sensing and collision checking extends footstep planning to 3D Adaptive level-of-detail planning

Personal Opinions Impressed by adaptive-level-of-detail planning Great application of AI search algorithms Didn’t explain ARA* and R* algorithms well Lack of resources for algorithms

Questions?

Works Cited Search-Based Footstep Planning by Armin Hornung, Daniel Maier, Maren Bennewitz Anytime Search-Based Footstep Planning with Suboptimality Bounds by Armin Hornung, Andrew Dornbush, Maxim Likhachev, Maren Bennewitz ARA*: Anytime A* with Provable Bounds on Sub-Optimality by Maxim Likhachev, Geogg Gorgon, Sebastian Thrun R* Search by Maxim Likhachev and Anthony Stentz