Login / Signup
Maciej Przybylski
ORCID
Publication Activity (10 Years)
Years Active: 2012-2024
Publications (10 Years): 3
Top Topics
Search Tree
Branch And Bound Algorithm
Asymptotically Optimal
Sat Solving
Top Venues
ICAPS
IEEE Robotics Autom. Lett.
Int. J. Appl. Math. Comput. Sci.
</>
Publications
</>
Maciej Przybylski
Asymptotically Optimal A* for Kinodynamic Planning.
IEEE Robotics Autom. Lett.
9 (5) (2024)
Maciej Przybylski
AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* Algorithm.
ICAPS
(2018)
Maciej Przybylski
,
Barbara Putz
D* Extra Lite: A Dynamic A* With Search-Tree Cutting and Frontier-Gap Repairing.
Int. J. Appl. Math. Comput. Sci.
27 (2) (2017)
Maciej Przybylski
,
Barbara Siemiatkowska
A New CNN-Based Method of Path Planning in Dynamic Environment.
ICAISC (2)
(2012)