D* Extra Lite: A Dynamic A* With Search–Tree Cutting and Frontier–Gap Repairing Cover

.blurhash-client-img { display: none !important; }

D* Extra Lite: A Dynamic A* With Search–Tree Cutting and Frontier–Gap Repairing

International Journal of Applied Mathematics and Computer Science

Volume 27 (2017): Issue 2 (June 2017)

By: Maciej Przybylski and Barbara Putz

Open Access

|Jul 2017

Authors

Maciej Przybylski

maciej.przybylski@mchtr.pw.edu.pl

Institute of Automatic Control and Robotics Warsaw University of Technology, ul. św. A. Boboli 8, 02-525, Warsaw, Poland

Barbara Putz

bputz@mchtr.pw.edu.pl

Institute of Automatic Control and Robotics Warsaw University of Technology, ul. św. A. Boboli 8, 02-525, Warsaw, Poland

DOI: https://doi.org/10.1515/amcs-2017-0020 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X

Journal RSS Feed

Language: English

Page range: 273 - 290

Submitted on: Jul 27, 2016

Accepted on: Mar 25, 2017

Published on: Jul 8, 2017

Published by: University of Zielona Góra

In partnership with: Paradigm Publishing Services

Publication frequency: 4 issues per year

Keywords:

shortest-path planning,

incremental heuristic search,

mobile robot navigation,

Related subjects:

Applied mathematics

© 2017 Maciej Przybylski, Barbara Putz, published by University of Zielona Góra
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.

Previous article Volume 27 (2017): Issue 2 (June 2017)Next article