Skip to content
Publish & Distribute
Publishing Solutions
Distribution Solutions
Library Services
Subjects
Architecture and Design
Arts
Business and Economics
Chemistry
Classical and Ancient Near Eastern Studies
Computer Sciences
Cultural Studies
Engineering
General Interest
Geosciences
History
Industrial Chemistry
Jewish Studies
Law
Library and Information Science, Book Studies
Life Sciences
Linguistics and Semiotics
Literary Studies
Materials Sciences
Mathematics
Medicine
Music
Pharmacy
Philosophy
Physics
Social Sciences
Sports and Recreation
Theology and Religion
Publications
Journals
Books
Proceedings
Publishers
Journal Matcher
Blog
Contact
Search
English
English
Deutsch
Polski
Español
Français
Italiano
Cart
Home
Journals
International Journal of Applied Mathematics and Computer Science
Volume 27 (2017): Issue 2 (June 2017)
Open Access
D* Extra Lite: A Dynamic A* With Search–Tree Cutting and Frontier–Gap Repairing
Maciej Przybylski
Maciej Przybylski
Institute of Automatic Control and Robotics Warsaw University of Technology, ul. św. A. Boboli 8, 02-525
Warsaw, Poland
Search for this author on
Sciendo
|
Google Scholar
Przybylski, Maciej
and
Barbara Putz
Barbara Putz
Institute of Automatic Control and Robotics Warsaw University of Technology, ul. św. A. Boboli 8, 02-525
Warsaw, Poland
Search for this author on
Sciendo
|
Google Scholar
Putz, Barbara
Jul 08, 2017
International Journal of Applied Mathematics and Computer Science
Volume 27 (2017): Issue 2 (June 2017)
About this article
Previous Article
Next Article
Abstract
References
Authors
Articles in this Issue
Preview
PDF
Cite
Share
Download Cover
Published Online:
Jul 08, 2017
Page range:
273 - 290
Received:
Jul 27, 2016
Accepted:
Mar 25, 2017
DOI:
https://doi.org/10.1515/amcs-2017-0020
Keywords
shortest-path planning
,
incremental heuristic search
,
mobile robot navigation
,
video games
© by Maciej Przybylski
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.
