A batch informed sampling-based algorithm for fast anytime asymptotically-optimal motion planning in cluttered environments

Jing Xu; Kechen Song; Hongwen Dong; Yunhui Yan

doi:10.1016/j.eswa.2019.113124

ScienceGate Book Chapters

JOURNAL ARTICLE

A batch informed sampling-based algorithm for fast anytime asymptotically-optimal motion planning in cluttered environments

Jing Xu Kechen Song Hongwen Dong Yunhui Yan

Year: 2019 Journal: Expert Systems with Applications Vol: 144 Pages: 113124-113124 Publisher: Elsevier BV

DOI: 10.1016/j.eswa.2019.113124

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Asymptotically optimal algorithm Motion (physics) Sampling (signal processing) Artificial intelligence Mathematical optimization Algorithm Motion planning Computer vision Mathematics

Metrics

Cited By

0.43

FWCI (Field Weighted Citation Impact)

Refs

0.66

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Robotic Path Planning Algorithms

Physical Sciences → Computer Science → Computer Vision and Pattern Recognition

Robotics and Sensor-Based Localization

Physical Sciences → Engineering → Aerospace Engineering

Robot Manipulation and Learning

Physical Sciences → Engineering → Control and Systems Engineering

A batch informed sampling-based algorithm for fast anytime asymptotically-optimal motion planning in cluttered environments

Metrics

Citation History

Topics

Related Documents

Informed Anytime Fast Marching Tree for Asymptotically Optimal Motion Planning

Informed anytime Bi-directional Fast Marching Tree for optimal motion planning in complex cluttered environments

Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search

Asymptotically Optimal Sampling-Based Motion Planning Through Anytime Incremental Lazy Bidirectional Heuristic Search

Asymptotically Optimal Lazy Lifelong Sampling-based Algorithm for Efficient Motion Planning in Dynamic Environments