David Zahrádka

Tel: +420-2-2435-4248	orcid.org/0000-0002-7380-8495
E-mail: david.zahradka@cvut.cz	David Zahradka at Google Scholar
Room no: CIIRC B:324	David Zahradka at ResearchGate

Thesis: Optimization-based control of the F1/10 autonomous racing car

Conference Papers

• Zahrádka, D., Mužíková, D., Kulich, M., Švancara, J., & Barták, R. (2025). Towards Holistic Approach to Robust Execution of MAPF Plans. Proceedings of the 17th International Conference on Agents and Artificial Intelligence (ICAART 2025), 1, 624–631.
  URL   BibTeX

  
  @inproceedings{zahradka2025holistic,
    title = {Towards {{Holistic Approach}} to {{Robust Execution}} of {{MAPF Plans}}},
    shorttitle = {Towards {{Holistic Approach}} to {{Robust Execution}} of {{MAPF Plans}}},
    booktitle = {Proceedings of the 17th {{International Conference}} on {{Agents}} and {{Artificial Intelligence}}},
    author = {Zahr{\'a}dka, David and Mu{\v z}{\'i}kov{\'a}, Denisa and Kulich, Miroslav and {\v S}vancara, Ji{\v r}{\'i} and Bart{\'a}k, Roman},
    year = {2025},
    volume = {1},
    pages = {624--631},
    publisher = {{SCITEPRESS - Science and Technology Publications}},
    address = {Porto, Portugal},
    doi = {10.5220/0013319700003890},
    isbn = {978-989-758-737-5},
    langid = {english},
  }
  
  
• Švancara, J., Zahrádka, D., Subramanian, M., Barták, R., & Kulich, M. (2025). Generating Safe Policies for Multi-Agent Path Finding with Temporal Uncertainty. Proceedings of the 17th International Conference on Agents and Artificial Intelligence (ICAART 2025), 3, 1238–1244.
  URL   BibTeX

  
  @inproceedings{svancara2025generating,
    title = {Generating {{Safe Policies}} for {{Multi-Agent Path Finding}} with {{Temporal Uncertainty}}},
    shorttitle = {Generating {{Safe Policies}} for {{Multi-Agent Path Finding}} with {{Temporal Uncertainty}}},
    booktitle = {Proceedings of the 17th {{International Conference}} on {{Agents}} and {{Artificial Intelligence}}},
    author = {{\v S}vancara, Ji{\v r}{\'i} and Zahr{\'a}dka, David and Subramanian, Mrinalini and Bart{\'a}k, Roman and Kulich, Miroslav},
    year = {2025},
    volume = {3},
    pages = {1238--1244},
    publisher = {{SCITEPRESS - Science and Technology Publications}},
    address = {Porto, Portugal},
    doi = {10.5220/0013315400003890},
    isbn = {978-989-758-737-5},
    langid = {english}
  }
  
  
• Zahradka, D., Andreychuk, A., Kulich, M., & Yakovlev, K. (2022). Quality Analysis of Multi-Agent Multi-Item Pickup and Delivery Solutions Using a Decoupled Approach. IFAC-PapersOnLine 55(38), 61-66.
  Presented at IFAC Symposium on Robot Control (SYROCO 2022).
  PDF   URL   BibTeX

  @inproceedings{zahradka2022quality,
  	title = {Quality {Analysis} of {Multi}-{Agent} {Multi}-{Item} {Pickup} and {Delivery} {Solutions} {Using} a {Decoupled} {Approach}},
  	volume = {55},
  	copyright = {All rights reserved},
  	url = {https://www.sciencedirect.com/science/article/pii/S2405896323001416},
  	doi = {10.1016/j.ifacol.2023.01.134},
  	language = {en},
  	urldate = {2023-02-05},
  	booktitle = {{IFAC}-{PapersOnLine}},
  	author = {Zahradka, David and Andreychuk, Anton and Kulich, Miroslav and Yakovlev, Konstantin},
  	month = jan,
  	year = {2022},
  	keywords = {Trajectory, Autonomous Mobile Robots, Delivery Robots, Multi Cooperative Robot Control, Path Planning, Transport},
  	pages = {61--66},
  }
  
  
• Zahradka, D., Andreychuk, A., Kulich, M., & Yakovlev, K. (2022, July). Lower and Upper Bounds for Multi-Agent Multi-Item Pickup and Delivery: When a Decoupled Approach is Good Enough. In Proceedings of the International Symposium on Combinatorial Search (SOCS2022) (Vol. 15, No. 1, pp. 329-331).
  PDF   URL   BibTeX

  @article{zahradka2022lower,
  	title = {Lower and {Upper} {Bounds} for {Multi}-{Agent} {Multi}-{Item} {Pickup} and {Delivery}: {When} a {Decoupled} {Approach} is {Good} {Enough} ({Extended} {Abstract})},
  	volume = {15},
  	copyright = {Copyright (c) 2022 Association for the Advancement of Artificial Intelligence},
  	issn = {2832-9163},
  	shorttitle = {Lower and {Upper} {Bounds} for {Multi}-{Agent} {Multi}-{Item} {Pickup} and {Delivery}},
  	url = {https://ojs.aaai.org/index.php/SOCS/article/view/21802},
  	language = {en},
  	number = {1},
  	urldate = {2022-11-22},
  	journal = {Proceedings of the International Symposium on Combinatorial Search},
  	author = {Zahrádka, David and Andreychuk, Anton and Kulich, Miroslav and Yakovlev, Konstantin},
  	month = jul,
  	year = {2022},
  	note = {Number: 1},
  	keywords = {Real-life Applications},
  	pages = {329--331},
  }
  
  
• Zahrádka, D., Pěnička, R., & Saska, M. (2018). Route Planning for Teams of Unmanned Aerial Vehicles Using Dubins Vehicle Model with Budget Constraint. International Conference on Modelling and Simulation for Autonomous Systems (pp. 365-389).
  URL   BibTeX

  @inproceedings{zahradka2018route,
    title={Route Planning for Teams of Unmanned Aerial Vehicles Using Dubins Vehicle Model with Budget Constraint},
    author={Zahr{\'a}dka, David and P{\v{e}}ni{\v{c}}ka, Robert and Saska, Martin},
    booktitle={International Conference on Modelling and Simulation for Autonomous Systems},
    pages={365--389},
    year={2018},
    organization={Springer}
  }
  
  

Workshops

• Zahrádka, D., Kubišta, D., & Kulich, M. (2023). Solving Robust Execution of Multi-Agent Pathfinding Plans as a Scheduling Problem . PlanRob 2023 workshop at ICAPS.
  URL   BibTeX

  @article{zahradka2023solving,
    title={Solving Robust Execution of Multi-Agent Pathfinding Plans as a Scheduling Problem (PlanRob 2023 workshop at ICAPS)},
    author={Zahr{\'a}dka, David and Kubi{\v{s}}ta, Daniel and Kulich, Miroslav}
  }