default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiri Svancara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2019
[j1]Roman Barták
, Jirí Svancara, Vera Skopková, David Nohejl, Ivan Krasicenko:
Multi-agent path finding on real robots. AI Commun. 32(3): 175-189 (2019)
Conference and Workshop Papers
- 2024
- [c28]Eliás Cizl, Jirí Svancara, Roman Barták:
The Effectiveness of Autonomous Intersections in a City. FLAIRS 2024 - [c27]Jirí Svancara, Dor Atzmon, Klaus Strauch, Roland Kaminski, Torsten Schaub:
Which Objective Function is Solved Faster in Multi-Agent Pathfinding? It Depends. ICAART (3) 2024: 23-33 - [c26]Roland Kaminski, Torsten Schaub, Klaus Strauch, Jirí Svancara:
Improving the Sum-of-Cost Methods for Reduction-Based Multi-Agent Pathfinding Solvers. ICAART (1) 2024: 264-271 - 2023
- [c25]Jirí Svancara, Philipp Obermeier, Matej Husár, Roman Barták, Torsten Schaub:
Multi-Agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? ICAART (1) 2023: 199-206 - [c24]Jan Behrens, Roland Kaminski, Torsten Schaub, Tran Cao Son, Jiri Svancara, Philipp Wanko:
Routing and Scheduling in different ways: Abridged Preliminary Report. ICLP Workshops 2023 - [c23]Jirí Svancara, Etienne Tignon, Roman Barták, Torsten Schaub, Philipp Wanko, Roland Kaminski:
Multi-Agent Pathfinding with Predefined Paths: To Wait, or Not to Wait, That Is the Question [Extended Abstract]. SOCS 2023: 185-186 - 2022
- [c22]Matej Husár, Jirí Svancara, Philipp Obermeier, Roman Barták, Torsten Schaub:
Reduction-based Solving of Multi-agent Pathfinding on Large Maps Using Graph Pruning. AAMAS 2022: 624-632 - [c21]Jirí Svancara, Marika Ivanová, Roman Barták:
Coordinated Collision-free Movement of Groups of Agents. ICAART (1) 2022: 26-33 - [c20]Jirí Svancara, Roman Barták:
Tackling Train Routing via Multi-agent Pathfinding and Constraint-based Scheduling. ICAART (1) 2022: 306-313 - [c19]Jirí Svancara, Philipp Obermeier, Matej Husár, Roman Barták, Torsten Schaub:
Multi-agent Pathfinding on Large Maps Using Graph Pruning: This Way or That Way? (Extended Abstract). SOCS 2022: 320-322 - 2021
- [c18]Roman Barták, Marika Ivanová, Jirí Svancara:
Colored Multi-Agent Path Finding: Solving Approaches. FLAIRS 2021 - [c17]Roman Barták, Marika Ivanová, Jirí Svancara:
From Classical to Colored Multi-Agent Path Finding. SOCS 2021: 150-152 - 2020
- [c16]Roman Barták, Jirí Svancara, Ivan Krasicenko:
MAPF Scenario: Software for Evaluating MAPF Plans on Real Robots. AAAI 2020: 13602-13603 - [c15]Vera Skopková, Roman Barták, Jirí Svancara:
What Does Multi-agent Path-finding Tell Us About Intelligent Intersections. ICAART (1) 2020: 250-257 - [c14]Jindrich Vodrázka, Roman Barták, Jirí Svancara:
On Modelling Multi-Agent Path Finding as a Classical Planning Problem. ICTAI 2020: 23-28 - [c13]Jindrich Vodrázka, Roman Barták, Jirí Svancara:
On Modelling Multi-Agent Path Finding as a Classical Planning Problem. SOCS 2020: 141-142 - 2019
- [c12]Jirí Svancara, Marek Vlk, Roni Stern, Dor Atzmon, Roman Barták:
Online Multi-Agent Pathfinding. AAAI 2019: 7732-7739 - [c11]Roman Barták, Ivan Krasicenko, Jirí Svancara:
Multi-Agent Path Finding on Real Robots. AAMAS 2019: 2333-2335 - [c10]Jirí Svancara, Roman Barták:
Combining Strengths of Optimal Multi-Agent Path Finding Algorithms. ICAART (1) 2019: 226-231 - [c9]Roman Barták, Ivan Krasicenko, Jirí Svancara:
Multi-Agent Path Finding on Ozobots. IJCAI 2019: 6491-6493 - [c8]Roman Barták, Jirí Svancara:
On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective. SOCS 2019: 10-17 - 2018
- [c7]Roman Barták, Jiri Svancara, Marek Vlk:
A Scheduling-Based Approach to Multi-Agent Path Finding with Weighted and Capacitated Arcs. AAMAS 2018: 748-756 - [c6]Jirí Svancara:
Bringing Multi-agent Path Finding Closer to Reality. AAMAS 2018: 1784-1785 - [c5]Roman Barták, Jirí Svancara, Vera Skopková, David Nohejl:
Multi-agent Path Finding on Real Robots: First Experience with Ozobots. IBERAMIA 2018: 290-301 - [c4]Jirí Svancara:
Bringing Multi-agent Path Finding Closer to Reality. IJCAI 2018: 5787-5788 - 2017
- [c3]Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski:
Integration of Independence Detection into SAT-based Optimal Multi-Agent Path Finding - A Novel SAT-based Optimal MAPF Solver. ICAART (2) 2017: 85-95 - [c2]Pavel Surynek, Jiri Svancara, Ariel Felner, Eli Boyarski:
Variants of Independence Detection in SAT-Based Optimal Multi-agent Path Finding. ICAART (Revised Selected Papers) 2017: 116-136 - [c1]Jiri Svancara, Pavel Surynek:
New Flow-based Heuristic for Search Algorithms Solving Multi-agent Path Finding. ICAART (2) 2017: 451-458
Informal and Other Publications
- 2024
- [i1]Roland Kaminski, Torsten Schaub, Tran Cao Son, Jirí Svancara, Philipp Wanko:
Routing and Scheduling in Answer Set Programming applied to Multi-Agent Path Finding: Preliminary Report. CoRR abs/2403.12153 (2024)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-10 02:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
