default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAntonín Komenda
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c47]Michaela Urbanovská, Antonín Komenda:
Explainability Insights to Cellular Simultaneous Recurrent Neural Networks for Classical Planning. ICAART (3) 2024: 592-599- 2023
- [j17]Michaela Urbanovská
, Antonín Komenda:
Analysis of Learning Heuristic Estimates for Grid Planning with Cellular Simultaneous Recurrent Networks. SN Comput. Sci. 4(6): 744 (2023) - [c46]Leah Chrestien, Tomás Pevný, Stefan Edelkamp, Antonín Komenda:
Heuristic Search Optimisation Using Planning and Curriculum Learning Techniques. EPIA (1) 2023: 495-507 - [c45]Michaela Urbanovská, Antonín Komenda:
Semantically Layered Representation for Planning Problems and Its Usage for Heuristic Computation Using Cellular Simultaneous Recurrent Neural Networks. ICAART (3) 2023: 493-500 - [c44]Leah Chrestien, Stefan Edelkamp, Antonín Komenda, Tomás Pevný:
Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal. NeurIPS 2023 - [i5]Leah Chrestien, Tomás Pevný, Stefan Edelkamp, Antonín Komenda:
Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goal. CoRR abs/2310.19463 (2023) - 2022
- [j16]Michal Stolba, Michaela Urbanovská, Antonín Komenda:
Privacy leakage of search-based multi-agent planning algorithms. Auton. Agents Multi Agent Syst. 36(2): 40 (2022) - [c43]Michaela Urbanovská, Antonín Komenda:
Learning Heuristic Estimates for Planning in Grid Domains by Cellular Simultaneous Recurrent Networks. ICAART (2) 2022: 203-213 - [c42]Michaela Urbanovská, Antonín Komenda:
Grid Representation in Neural Networks for Automated Planning. ICAART (3) 2022: 871-880 - [i4]Leah Chrestien, Tomás Pevný, Antonín Komenda, Stefan Edelkamp:
A Differentiable Loss Function for Learning Heuristics in A. CoRR abs/2209.05206 (2022) - 2021
- [j15]Michaela Urbanovská, Antonín Komenda:
Neural networks for model-free and scale-free automated planning. Knowl. Inf. Syst. 63(12): 3103-3138 (2021) - [i3]Leah Chrestien, Tomás Pevný, Antonín Komenda, Stefan Edelkamp:
Heuristic Search Planning with Deep Neural Networks using Imitation, Attention and Curriculum Learning. CoRR abs/2112.01918 (2021) - 2020
- [c41]Daniel Fiser, Rostislav Horcík, Antonín Komenda:
Strengthening Potential Heuristics with Mutexes and Disambiguations. ICAPS 2020: 124-133 - [c40]Radek Bumbálek, Michal Stolba, Antonín Komenda:
Secure Multi-agent Planning via Sharemind. ICAART (2) 2020: 852-859
2010 – 2019
- 2019
- [c39]Michal Stolba, Daniel Fiser, Antonín Komenda:
Privacy Leakage of Search-Based Multi-Agent Planning Algorithms. ICAPS 2019: 482-490 - [c38]Michal Stolba, Michaela Urbanovská, Daniel Fiser, Antonín Komenda:
Cost Partitioning for Multi-agent Planning. ICAART (2) 2019: 40-49 - [c37]Michal Stolba, Michaela Urbanovská, Daniel Fiser, Antonín Komenda:
A General Approach to Distributed and Privacy-Preserving Heuristic Computation. ICAART (Revised Selected Papers) 2019: 55-71 - 2018
- [j14]Alejandro Torreño, Eva Onaindia, Antonín Komenda, Michal Stolba:
Cooperative Multi-Agent Planning: A Survey. ACM Comput. Surv. 50(6): 84:1-84:32 (2018) - [j13]Daniel Fiser, Antonín Komenda:
Fact-Alternating Mutex Groups for Classical Planning. J. Artif. Intell. Res. 61: 475-521 (2018) - [j12]Jan Tozicka, Jan Jakubuv, Antonín Komenda:
Recursive Reductions of Action Dependencies for Coordination-Based Multiagent Planning. Trans. Comput. Collect. Intell. 28: 66-92 (2018) - [j11]Michal Stolba, Jan Tozicka, Antonín Komenda:
Quantifying Privacy Leakage in Multi-Agent Planning. ACM Trans. Internet Techn. 18(3): 28:1-28:21 (2018) - [c36]Jan Mrkos, Antonín Komenda, Michal Jakob:
Revenue Maximization for Electric Vehicle Charging Service Providers Using Sequential Dynamic Pricing. AAMAS 2018: 832-840 - [c35]Daniel Fiser, Antonín Komenda:
Concise Finite-Domain Representations for Factored MA-PDDL Planning Tasks. ICAART (2) 2018: 306-313 - [c34]Jan Mrkos, Antonín Komenda, Michal Jakob:
Dynamic Pricing Strategy for Electromobility using Markov Decision Processes. ICAART (2) 2018: 507-514 - [c33]Daniel Fiser, Antonín Komenda:
Fact-Alternating Mutex Groups for Classical Planning (Extended Abstract). IJCAI 2018: 5603-5607 - 2017
- [j10]Michal Stolba, Antonín Komenda:
The MADLA planner: Multi-agent planning by combination of distributed and local heuristic search. Artif. Intell. 252: 175-210 (2017) - [c32]Jan Tozicka, Michal Stolba, Antonín Komenda:
The Limits of Strong Privacy Preserving Multi-Agent Planning. ICAPS 2017: 297-305 - [c31]Jan Tozicka, Antonín Komenda, Michal Stolba:
ε-Strong Privacy Preserving Multiagent Planner by Computational Tractability. ICAART (1) 2017: 51-57 - [c30]Antonín Komenda, Jan Tozicka, Michal Stolba:
ε-Strong Privacy Preserving Multi-agent Planning. ICAART (Revised Selected Papers) 2017: 137-156 - [i2]Alejandro Torreño, Eva Onaindia, Antonín Komenda, Michal Stolba:
Cooperative Multi-Agent Planning: A Survey. CoRR abs/1711.09057 (2017) - 2016
- [j9]Antonín Komenda, Michal Stolba, Daniel L. Kovacs:
The International Competition of Distributed and Multiagent Planners (CoDMAP). AI Mag. 37(3): 109-115 (2016) - [j8]Jan Tozicka, Jan Jakubuv, Antonín Komenda, Michal Pechoucek:
Privacy-concerned multiagent planning. Knowl. Inf. Syst. 48(3): 581-618 (2016) - [j7]Jan Tozicka, Antonín Komenda:
Diverse Planning for UAV Control and Remote Sensing. Sensors 16(12): 2199 (2016) - [c29]Michal Stolba, Antonín Komenda, Daniel L. Kovacs:
Competition of Distributed and Multiagent Planners (CoDMAP). AAAI 2016: 4343-4345 - [c28]Michal Stolba, Daniel Fiser, Antonín Komenda:
Potential Heuristics for Multi-Agent Planning. ICAPS 2016: 308-316 - [c27]Jan Tozicka, Jan Jakubuv, Martin Svatos, Antonín Komenda:
Recursive Polynomial Reductions for Classical Planning. ICAPS 2016: 317-325 - [c26]Michal Stolba, Jan Tozicka, Antonín Komenda:
Secure Multi-Agent Planning. PrAISe@ECAI 2016: 11:1-11:8 - [c25]Michal Stolba, Jan Tozicka, Antonín Komenda:
Secure Multi-Agent Planning Algorithms. ECAI 2016: 1714-1715 - [c24]Jan Tozicka, Jan Jakubuv, Antonín Komenda:
Recursive Reductions of Internal Dependencies in Multiagent Planning. ICAART (2) 2016: 181-191 - 2015
- [j6]Antonín Komenda, Peter Novák, Michal Pechoucek:
Multiagent plan repair by combined prefix and suffix reuse. Multiagent Grid Syst. 11(1): 33-57 (2015) - [j5]Jan Tozicka, Jan Jakubuv, Karel Durkota, Antonín Komenda:
Extensibility Based Multiagent Planner with Plan Diversity Metrics. Trans. Comput. Collect. Intell. 20: 117-139 (2015) - [c23]Alexander Shleyfman, Antonín Komenda, Carmel Domshlak:
On Interruptible Pure Exploration in Multi-Armed Bandits. AAAI 2015: 3592-3598 - [c22]Michal Stolba, Daniel Fiser, Antonín Komenda:
Admissible Landmark Heuristic for Multi-Agent Planning. ICAPS 2015: 211-219 - [c21]Jan Tozicka, Jan Jakubuv, Antonín Komenda:
From Public Plans to Global Solutions in Multiagent Planning. EUMAS/AT 2015: 21-33 - [c20]Jan Jakubuv, Jan Tozicka, Antonín Komenda:
Multiagent Planning by Plan Set Intersection and Plan Verification. ICAART (2) 2015: 173-182 - [c19]Jan Jakubuv, Jan Tozicka, Antonín Komenda:
Using Process Calculi for Plan Verification in Multiagent Planning. ICAART (Revised Selected Papers) 2015: 245-261 - 2014
- [j4]Antonín Komenda, Peter Novák, Michal Pechoucek:
Domain-independent multi-agent plan repair. J. Netw. Comput. Appl. 37: 76-88 (2014) - [c18]Michal Stolba, Antonín Komenda:
Relaxation Heuristics for Multiagent Planning. ICAPS 2014 - [c17]Antonín Komenda, Alexander Shleyfman, Carmel Domshlak:
On Robustness of CMAB Algorithms: Experimental Approach. CGW@ECAI 2014: 16-28 - [c16]Alexander Shleyfman, Antonín Komenda, Carmel Domshlak:
On Combinatorial Actions and CMABs with Linear Side Information. ECAI 2014: 825-830 - [c15]Jan Tozicka, Jan Jakubuv, Antonín Komenda:
Generating Multi-Agent Plans by Distributed Intersection of Finite State Machines. ECAI 2014: 1111-1112 - [c14]Jan Tozicka, Jan Jakubuv, Karel Durkota, Antonín Komenda, Michal Pechoucek:
Multiagent Planning Supported by Plan Diversity Metrics and Landmark Actions. ICAART (1) 2014: 178-189 - 2013
- [j3]Antonín Komenda, Jirí Vokrínek, Michal Cáp, Michal Pechoucek:
Developing Multiagent Algorithms for Tactical Missions Using Simulation. IEEE Intell. Syst. 28(1): 42-49 (2013) - [c13]Martin Selecký, Michal Stolba, Tomás Meiser, Michal Cáp, Antonín Komenda, Milan Rollo, Jirí Vokrínek, Michal Pechoucek:
Deployment of multi-agent algorithms for tactical operations on UAV hardware. AAMAS 2013: 1407-1408 - [p1]Peter Novák, Antonín Komenda, Michal Cáp, Jirí Vokrínek, Michal Pechoucek:
Simulated Multi-robot Tactical Missions in Urban Warfare. Multiagent Systems and Applications - Volume 1 2013: 147-183 - 2012
- [c12]Antonín Komenda, Peter Novák, Michal Pechoucek:
Decentralized multi-agent plan repair in dynamic environments. AAMAS 2012: 1239-1240 - [c11]Peter Novák, Antonín Komenda, Viliam Lisý, Branislav Bosanský, Michal Cáp, Michal Pechoucek:
Tactical operations of multi-robot teams in urban warfare (demonstration). AAMAS 2012: 1473-1474 - [c10]Michal Jakob, Zbynek Moler, Antonín Komenda, Zhengyu Yin, Albert Xin Jiang, Matthew Paul Johnson, Michal Pechoucek, Milind Tambe:
AgentPolis: towards a platform for fully agent-based modeling of multi-modal transportation (demonstration). AAMAS 2012: 1501-1502 - [i1]Antonín Komenda, Peter Novák, Michal Pechoucek:
Decentralized Multi-agent Plan Repair in Dynamic Environments. CoRR abs/1202.2773 (2012) - 2011
- [j2]Jirí Vokrínek, Antonín Komenda, Michal Pechoucek:
Abstract Architecture for Task-oriented Multi-agent Problem Solving. IEEE Trans. Syst. Man Cybern. Part C 41(1): 31-40 (2011) - [j1]Antonín Komenda, Jirí Vokrínek, Michal Pechoucek:
Plan representation and execution in multi-actor scenarios by means of social commitments. Web Intell. Agent Syst. 9(2): 123-133 (2011) - [c9]Michal Cáp, Jirí Vokrínek, Antonín Komenda:
Communication- and Computation- Bounded Agents in Multi-agent Simulations. HoloMAS 2011: 114-123 - [c8]Jirí Vokrínek, Peter Novák, Antonín Komenda:
Ground Tactical Mission Support by Multi-agent Control of UAV Operations. HoloMAS 2011: 225-234 - [c7]Lukás Chrpa, Antonín Komenda:
Smoothed Hex-grid Trajectory Planning using Helicopter Dynamics. ICAART (1) 2011: 629-632 - 2010
- [c6]Jirí Vokrínek, Antonín Komenda, Michal Pechoucek:
Agents towards vehicle routing problems. AAMAS 2010: 773-780
2000 – 2009
- 2009
- [c5]Jirí Vokrínek, Antonín Komenda, Michal Pechoucek:
Decommitting in multi-agent execution in non-deterministic environment: experimental approach. AAMAS (2) 2009: 977-984 - [c4]Antonín Komenda, Jirí Vokrínek, Michal Pechoucek, Gerhard Wickler, Jeff Dalton, Austin Tate:
Distributed planning and coordination in non-deterministic environments. AAMAS (2) 2009: 1401-1402 - [c3]Milan Rollo, Antonín Komenda:
Mobility Model for Tactical Networks. HoloMAS 2009: 254-265 - [c2]Jirí Vokrínek, Antonín Komenda, Michal Pechoucek:
Relaxation of Social Commitments in Multi-Agent Dynamic Environment. ICAART 2009: 520-525 - 2008
- [c1]Antonín Komenda, Michal Pechoucek, Jirí Bíba, Jirí Vokrínek:
Planning and re-planning in multi-actors scenarios by means of social commitments. IMCSIT 2008: 39-45
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-04-24 23:04 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:
