Optimal kinodynamic motion planning in environments with unexpected obstacles

No abstract is available for this paper.

• Publication year

  2014

• Venue

  Allerton Conference on Communication, Control, and Computing

• Publication date

  2014-07-18

• Fields of study

  Mathematics, Computer Science, Engineering

• Identifiers
  DOI 10.1109/ALLERTON.2014.7028567
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Use of relaxation methods in sampling-based algorithms for optimal motion planning

  2013cited by this paper
• Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions

  2013cited by this paper
• Motion Planning

  2011cited by this paper
• IEEE International Conference on Robotics and Automation (ICRA) におけるフルードパワー技術の研究動向

  2011cited by this paper
• Sampling-based algorithms for optimal motion planning

  2011cited by this paper
• Optimal kinodynamic motion planning using incremental sampling-based methods

  2010cited by this paper
• Lazy Reconfiguration Forest (LRF) - An Approach for Motion Planning with Multiple Tasks in Dynamic Environments

  2007cited by this paper
• Multipartite RRTs for Rapid Replanning in Dynamic Environments

  2007cited by this paper
• Replanning with RRTs

  2006cited by this paper
• D*lite

  2002cited by this paper
• An incremental learning approach to motion planning with roadmap management

  2002cited by this paper
• Real-time randomized path planning for robot navigation

  2002cited by this paper
• RRT-connect: An efficient approach to single-query path planning

  2000cited by this paper
• Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces

  1996cited by this paper
• The Focussed D* Algorithm for Real-Time Replanning

  1995cited by this paper
• Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape

  1987cited by this paper
• On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents

  1957cited by this paper

• A Survey of Asymptotically Optimal Sampling-based Motion Planning Methods

  2020cites this paper
• Asymptotically Optimal Sampling-Based Motion Planning Methods

  2020cites this paper
• Improved Performance of Asymptotically Optimal Rapidly Exploring Random Trees

  2018cites this paper
• Exploiting Photometric Information for Planning Under Uncertainty

  2015cites this paper