Maciej Przybylski

Orcid: 0000-0002-8706-0676

According to our database1, Maciej Przybylski authored at least 5 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Asymptotically Optimal A* for Kinodynamic Planning.
IEEE Robotics Autom. Lett., May, 2024

2018
AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* Algorithm.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017
D* Extra Lite: A Dynamic A* With Search-Tree Cutting and Frontier-Gap Repairing.
Int. J. Appl. Math. Comput. Sci., 2017

2015
Integration of Qualitative and Quantitative Spatial Data within a Semantic Map for Service Robots.
Proceedings of the Progress in Automation, Robotics and Measuring Techniques, 2015

2012
A New CNN-Based Method of Path Planning in Dynamic Environment.
Proceedings of the Artificial Intelligence and Soft Computing, 2012


  Loading...