Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRoman Barták
Person information
- affiliation: Charles University, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2014
[b1]Roman Barták
, Robert A. Morris, Kristen Brent Venable:
An Introduction to Constraint-Based Temporal Reasoning. Synthesis Lectures on Artificial Intelligence and Machine Learning, Morgan & Claypool Publishers 2014, ISBN 978-3-031-00439-1
Journal Articles
- 2023
- [j40]Avraham Natan, Meir Kalech, Roman Barták:
Diagnosis of intermittent faults in Multi-Agent Systems: An SFL approach. Artif. Intell. 324: 103994 (2023) - 2022
- [j39]Lukás Chrpa, Roman Barták, Jindrich Vodrázka, Marta Vomlelová:
Attributed Transition-Based Domain Control Knowledge for Domain-Independent Planning. IEEE Trans. Knowl. Data Eng. 34(9): 4089-4101 (2022) - 2020
- [j38]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding and Executing. J. Artif. Intell. Res. 67: 549-579 (2020) - 2019
- [j37]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) - [j36]Roman Barták, Eric Bell, Keith Brawner, Vasile Rus:
Report on the Thirty-Second International Florida Artificial Intelligence Research Society Conference (FLAIRS-32). AI Mag. 40(4): 83-84 (2019) - 2018
- [j35]Keith Brawner, Vasile Rus, Roman Barták, Zdravko Markov:
Report on the Thirty-First International Florida Artificial Intelligence Research Society Conference (FLAIRS-31). AI Mag. 39(4): 23-24 (2018) - 2017
- [j34]Monica Anderson, Roman Barták, John S. Brownstein, David L. Buckeridge, Hoda Eldardiry, Christopher W. Geib, Maria L. Gini, Aaron Isaksen, Sarah Keren, Robert Laddaga, Viliam Lisý, Rodney Martin, David R. Martinez, Martin Michalowski, Loizos Michael, Reuth Mirsky, Thanh Hai Nguyen, Michael J. Paul, Enrico Pontelli, Scott Sanner, Arash Shaban-Nejad, Arunesh Sinha, Shirin Sohrabi, Kumar Sricharan, Biplav Srivastava, Mark Stefik, William W. Streilein, Nathan R. Sturtevant, Kartik Talamadupula, Michael Thielscher, Julian Togelius, Tran Cao Son, Long Tran-Thanh, Neal Wagner, Byron C. Wallace, Szymon Wilk, Jichen Zhu:
Reports of the Workshops of the Thirty-First AAAI Conference on Artificial Intelligence. AI Mag. 38(3): 72-82 (2017) - [j33]Roman Barták, Lukás Chrpa, Agostino Dovier, Jindrich Vodrázka, Neng-Fa Zhou:
Modeling and solving planning problems in tabled logic programming: Experience from the Cave Diving domain. Sci. Comput. Program. 147: 54-77 (2017) - [j32]Roman Barták:
Constraint Solving and Planning with Picat by Neng-Fa Zhou , Håkan Kjellerstrand , and Jonathan Fruhman , xi + 148 pages, Springer, 2015. Paperback, ISBN 978-3-319-25881-2. Theory Pract. Log. Program. 17(1): 118-120 (2017) - 2016
- [j31]Martin Cerný, Roman Barták, Cyril Brom, Jakub Gemrot:
To Plan or to Simply React? An Experimental Study of Action Planning in a Game Environment. Comput. Intell. 32(4): 668-710 (2016) - [j30]Roman Barták, Jindrich Vodrázka:
An Experimental Study of Influence of Modeling and Solving Techniques on Performance of a Tabled Logic Programming Planner. Fundam. Informaticae 149(1-2): 35-60 (2016) - [j29]Miguel A. Salido, Roman Barták:
Introduction to the special issue on constraint satisfaction for planning and scheduling. Knowl. Eng. Rev. 31(5): 415-416 (2016) - 2015
- [j28]Filip Dvorak, Daniel Toropila, Roman Barták:
Yet more planning efficiency: Finite-domain state-variable reformulation. J. Exp. Theor. Artif. Intell. 27(5): 543-576 (2015) - [j27]Neng-Fa Zhou, Roman Barták, Agostino Dovier:
Planning as tabled logic programming. Theory Pract. Log. Program. 15(4-5): 543-558 (2015) - 2014
- [j26]Roman Barták, Vladimír Rovenský:
On verification of nested workflows with extra constraints: From theory to practice. Expert Syst. Appl. 41(3): 904-918 (2014) - [j25]Roman Barták, Neng-Fa Zhou:
Using Tabled Logic Programming to Solve the Petrobras Planning Problem. Theory Pract. Log. Program. 14(4-5): 697-710 (2014) - 2013
- [j24]Roman Barták, Radomír Cernoch, Ondrej Kuzelka, Filip Zelezný:
Formulating the template ILP consistency problem as a constraint satisfaction problem. Constraints An Int. J. 18(2): 144-165 (2013) - [j23]Roman Barták, Simone Fratini, Thomas Leo McCluskey:
Preface to special issue on Knowledge Engineering for Planning and Scheduling. Knowl. Eng. Rev. 28(2): 117-119 (2013) - 2011
- [j22]Roman Barták, Miguel A. Salido:
Constraint satisfaction for planning and scheduling problems. Constraints An Int. J. 16(3): 223-227 (2011) - 2010
- [j21]Roman Barták, Simone Fratini, Lee McCluskey:
The Third Competition on Knowledge Engineering for Planning and Scheduling. AI Mag. 31(1): 95-98 (2010) - [j20]Toshinori Munakata, Roman Barták:
Logic programming for combinatorial problems. Artif. Intell. Rev. 33(1-2): 135-150 (2010) - [j19]Roman Barták, Ondrej Cepek, Pavel Surynek:
Discovering implied constraints in precedence graphs with alternatives. Ann. Oper. Res. 180(1): 233-263 (2010) - [j18]Roman Barták, Daniel Toropila:
Solving Sequential Planning Problems via Constraint Satisfaction. Fundam. Informaticae 99(2): 125-145 (2010) - [j17]Roman Barták, Miguel A. Salido, Francesca Rossi:
Constraint satisfaction techniques in planning and scheduling. J. Intell. Manuf. 21(1): 5-15 (2010) - [j16]Roman Barták, James Little, Oscar Manzano, Con Sheahan:
From enterprise models to scheduling models: bridging the gap. J. Intell. Manuf. 21(1): 121-132 (2010) - [j15]Roman Barták, Amedeo Cesta, Lee McCluskey, Miguel A. Salido:
Preface to special issue on planning and scheduling. Knowl. Eng. Rev. 25(3): 247-248 (2010) - [j14]Roman Barták, Miguel A. Salido, Francesca Rossi:
New trends in constraint satisfaction, planning, and scheduling: a survey. Knowl. Eng. Rev. 25(3): 249-279 (2010) - [j13]Roman Barták, Hana Rudová:
Special issue on applications and methodologies for planning and scheduling: editorial. J. Sched. 13(4): 299-300 (2010) - 2008
- [j12]Roman Barták:
Rina Dechter , Constraint Processing, Morgan Kaufmann Publisher (2003) ISBN 1-55860-890-7, Francesca Rossi, Peter van Beek and Toby Walsh, Editors, Handbook of Constraint Programming, Elsevier (2006) ISBN 978-0-444-52726-4. Comput. Sci. Rev. 2(2): 123-130 (2008) - [j11]Miguel A. Salido, Antonio Garrido, Roman Barták:
Introduction: Special issue on constraint satisfaction techniques for planning and scheduling problems. Eng. Appl. Artif. Intell. 21(5): 679-682 (2008) - [j10]Roman Barták, Ondrej Cepek:
Incremental Filtering Algorithms for Precedence and Dependency Constraints. Int. J. Artif. Intell. Tools 17(1): 205-221 (2008) - 2007
- [j9]Roman Barták, Lee McCluskey:
Introduction to the Special Issue on Knowledge Engineering Tools and Techniques for Automated Planning and Scheduling Systems. Knowl. Eng. Rev. 22(2): 115-116 (2007) - 2006
- [j8]Roman Barták, Lee McCluskey:
The First Competition on Knowledge Engineering for Planning and Scheduling. AI Mag. 27(1): 97-98 (2006) - [j7]Roman Barták, Michela Milano:
Introduction to the Special Issue on the Integration of AI and OR Techniques in CP for Combinatorial Optimization (CPAIOR 2005). Constraints An Int. J. 11(4): 269-270 (2006) - 2005
- [j6]Roman Barták:
R. Dechter, Constraint Processing, Morgan Kaufmann (2003). Artif. Intell. 169(2): 142-145 (2005) - [j5]Petr Vilím, Roman Barták, Ondrej Cepek:
Extension of O(n log n) Filtering Algorithms for the Unary Resource Constraint to Optional Activities. Constraints An Int. J. 10(4): 403-425 (2005) - 2004
- [j4]Roman Barták:
The CP-04 Workshop on CSP Techniques with Immediate Application (Conference Report). IEEE Intell. Informatics Bull. 4: 3 (2004) - 2003
- [j3]Roman Barták:
Dynamic Global Constraints in Backtracking Based Environments. Ann. Oper. Res. 118(1-4): 101-119 (2003) - 2000
- [j2]Roman Barták:
Conceptual Models for Combined Planning and Scheduling. Electron. Notes Discret. Math. 4: 1 (2000) - 1997
- [j1]Roman Barták, Petr Stepánek:
Extendible meta-interpreters. Kybernetika 33(3): 291-310 (1997)
Conference and Workshop Papers
- 2024
- [c154]Jakub Mestek, Roman Barták:
Multi-Agent Path Finding: Policies Instead of Plans. ICAART (1) 2024: 95-104 - 2023
- [c153]Songtuan Lin, Gregor Behnke, Simona Ondrcková, Roman Barták, Pascal Bercher:
On Total-Order HTN Plan Verification with Method Preconditions - An Extension of the CYK Parsing Algorithm. AAAI 2023: 12041-12048 - [c152]Kristýna Pantucková, Roman Barták:
Using Earley Parser for Recognizing Totally Ordered Hierarchical Plans. ECAI 2023: 1819-1826 - [c151]Simona Ondrcková, Roman Barták, Pascal Bercher, Gregor Behnke:
Lessons Learned from the CYK Algorithm for Parsing-based Verification of Hierarchical Plans. FLAIRS 2023 - [c150]Kristýna Pantucková, Simona Ondrcková, Roman Barták:
Parsing-Based Recognition of Hierarchical Plans Using the Grammar Constraint. FLAIRS 2023 - [c149]Simona Ondrcková, Roman Barták, Pascal Bercher, Gregor Behnke:
On the Impact of Grounding on HTN Plan Verification via Parsing. ICAART (3) 2023: 92-99 - [c148]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 - [c147]Lukás Chrpa, Roman Barták, Jindrich Vodrázka, Marta Vomlelová:
Attributed Transition-Based Domain Control Knowledge for Domain-Independent Planning (Extended Abstract). ICDE 2023: 3879-3880 - [c146]Simona Ondrcková, Roman Barták:
On Semantics of Hierarchical Planning Domain Models with Decomposition Constraints and Empty Methods. ICTAI 2023: 349-353 - [c145]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
- [c144]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 - [c143]Simona Ondrcková, Roman Barták, Pascal Bercher, Gregor Behnke:
On Heuristics for Parsing-based Verification of Hierarchical Plans with a Goal Task. FLAIRS 2022 - [c142]Jirí Svancara, Marika Ivanová, Roman Barták:
Coordinated Collision-free Movement of Groups of Agents. ICAART (1) 2022: 26-33 - [c141]Jirí Svancara, Roman Barták:
Tackling Train Routing via Multi-agent Pathfinding and Constraint-based Scheduling. ICAART (1) 2022: 306-313 - [c140]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
- [c139]Roman Barták, Jakub Mestek:
OzoMorph: Demonstrating Colored Multi-Agent Path Finding on Real Robots. AAAI 2021: 15991-15993 - [c138]Roman Barták, Marika Ivanová, Jirí Svancara:
Colored Multi-Agent Path Finding: Solving Approaches. FLAIRS 2021 - [c137]Kristýna Pantucková, Roman Barták:
Compilation-Based Approaches to Parallel Planning: An Empirical Comparison. FLAIRS 2021 - [c136]Roman Barták, Simona Ondrcková, Gregor Behnke, Pascal Bercher:
On the Verification of Totally-Ordered HTN Plans. ICTAI 2021: 263-267 - [c135]Michal Nekvinda, Roman Barták:
Contingent Planning for Robust Multi-Agent Path Finding. ICTAI 2021: 487-492 - [c134]Roman Barták, Simona Ondrcková, Gregor Behnke, Pascal Bercher:
Correcting Hierarchical Plans by Action Deletion. KR 2021: 99-109 - [c133]Roman Barták, Marika Ivanová, Jirí Svancara:
From Classical to Colored Multi-Agent Path Finding. SOCS 2021: 150-152 - [c132]Michal Nekvinda, Roman Barták, Meir Kalech:
Contingent Planning for Robust Multi-Agent Path Finding. SOCS 2021: 185-187 - 2020
- [c131]Roman Barták, Jirí Svancara, Ivan Krasicenko:
MAPF Scenario: Software for Evaluating MAPF Plans on Real Robots. AAAI 2020: 13602-13603 - [c130]Otakar Trunda, Roman Barták:
Deep Learning of Heuristics for Domain-independent Planning. ICAART (2) 2020: 79-88 - [c129]Vera Skopková, Roman Barták, Jirí Svancara:
What Does Multi-agent Path-finding Tell Us About Intelligent Intersections. ICAART (1) 2020: 250-257 - [c128]Otakar Trunda, Roman Barták:
Heuristic Learning in Domain-Independent Planning: Theoretical Analysis and Experimental Evaluation. ICAART (Revised Selected Papers) 2020: 254-279 - [c127]Marta Vomlelová, Jindrich Vodrázka, Roman Barták, Lukás Chrpa:
Automated Acquisition of Control Knowledge for Classical Planners. ICAART (2) 2020: 959-966 - [c126]Jindrich Vodrázka, Roman Barták, Jirí Svancara:
On Modelling Multi-Agent Path Finding as a Classical Planning Problem. ICTAI 2020: 23-28 - [c125]Roman Barták, Simona Ondrcková, Adrien Maillard, Gregor Behnke, Pascal Bercher:
A Novel Parsing-based Approach for Verification of Hierarchical Plans. ICTAI 2020: 118-125 - [c124]Jindrich Vodrázka, Roman Barták, Jirí Svancara:
On Modelling Multi-Agent Path Finding as a Classical Planning Problem. SOCS 2020: 141-142 - 2019
- [c123]Jirí Svancara, Marek Vlk, Roni Stern, Dor Atzmon, Roman Barták:
Online Multi-Agent Pathfinding. AAAI 2019: 7732-7739 - [c122]Roman Barták, Ivan Krasicenko, Jirí Svancara:
Multi-Agent Path Finding on Real Robots. AAMAS 2019: 2333-2335 - [c121]Roman Barták, Keith Brawner:
FLAIRS-32 Poster Abstracts. FLAIRS 2019: 509- - [c120]Jirí Svancara, Roman Barták:
Combining Strengths of Optimal Multi-Agent Path Finding Algorithms. ICAART (1) 2019: 226-231 - [c119]Roman Barták, Ivan Krasicenko, Jirí Svancara:
Multi-Agent Path Finding on Ozobots. IJCAI 2019: 6491-6493 - [c118]Roman Barták, Jirí Svancara:
On SAT-Based Approaches for Multi-Agent Path Finding with the Sum-of-Costs Objective. SOCS 2019: 10-17 - [c117]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, Eli Boyarski:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. SOCS 2019: 151-158 - 2018
- [c116]Roman Barták, Adrien Maillard, Rafael Cauê Cardoso:
Validation of Hierarchical Plans via Parsing of Attribute Grammars. AAAI Workshops 2018: 593-600 - [c115]Roman Barták, Adrien Maillard, Rafael Cauê Cardoso:
Validation of Hierarchical Plans via Parsing of Attribute Grammars. AAAI Spring Symposia 2018 - [c114]Roman Barták, Adrien Maillard, Rafael Cauê Cardoso:
Validation of Hierarchical Plans via Parsing of Attribute Grammars. ICAPS 2018: 11-19 - [c113]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 - [c112]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding. AAMAS 2018: 1862-1864 - [c111]Roman Barták, David Obdrzálek:
Special Track on Autonomous Robots and Agents. FLAIRS 2018: 329 - [c110]Roman Barták, Jirí Svancara, Vera Skopková, David Nohejl:
Multi-agent Path Finding on Real Robots: First Experience with Ozobots. IBERAMIA 2018: 290-301 - [c109]Jirí Kucera, Roman Barták:
LOUGA: Learning Planning Operators Using Genetic Algorithms. PKAW 2018: 124-138 - [c108]Dor Atzmon, Roni Stern, Ariel Felner, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
Robust Multi-Agent Path Finding. SOCS 2018: 2-9 - 2017
- [c107]Marek Vlk, Roman Barták, Zdenek Hanzálek:
Minimization of useless work in resource failure recovery of workflow schedules. ETFA 2017: 1-8 - [c106]Roman Barták, Marta Vomlelová:
Using Machine Learning to Identify Activities of a Flying Drone from Sensor Readings. FLAIRS 2017: 436-441 - [c105]Neng-Fa Zhou, Roman Barták:
// Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding. ICLP (Technical Communications) 2017: 11:1-11:2 - [c104]Roman Barták, Neng-Fa Zhou, Roni Stern, Eli Boyarski, Pavel Surynek:
Modeling and Solving the Multi-agent Pathfinding Problem in Picat. ICTAI 2017: 959-966 - [c103]Roman Barták, Adrien Maillard:
Attribute grammars with set attributes and global constraints as a unifying framework for planning domain models. PPDP 2017: 39-48 - [c102]Jan Skoda, Roman Barták:
3D Navigation for a Mobile Robot. ROBOT (2) 2017: 345-356 - [c101]Dor Atzmon, Ariel Felner, Roni Stern, Glenn Wagner, Roman Barták, Neng-Fa Zhou:
k-Robust Multi-Agent Path Finding. SOCS 2017: 157-158 - 2016
- [c100]Marco De Bortoli, Roman Barták, Agostino Dovier, Neng-Fa Zhou:
Compiling and Executing PDDL in Picat. CILC 2016: 132-147 - [c99]Roman Barták, Jindrich Vodrázka:
Domain Modeling for Planning as Logic Programming. FLAIRS 2016: 8-13 - [c98]Roman Barták, Vladislav Kubon:
On Similarities Between Workflow Verification and Grammar Checking. FLAIRS 2016: 585-590 - [c97]Jindrich Vodrázka, Roman Barták:
The Benefit of Control Knowledge and Heuristics During Search in Planning. ICAART (2) 2016: 552-559 - [c96]Roman Barták, Agostino Dovier, Neng-Fa Zhou:
Multiple-Origin-Multiple-Destination Path Finding with Minimal Arc Usage: Complexity and Models. ICTAI 2016: 91-97 - [c95]Roman Barták, Michal Koutný, David Obdrzálek:
Practical 3D Tracking Using Low-Cost Cameras. IJCAI 2016: 4236-4237 - [c94]Roman Barták, Neng-Fa Zhou, Agostino Dovier:
Multiple-Origin-Multiple-Destination Path Finding with Minimal Arc Usage: Complexity and Models. KnowProS@IJCAI 2016 - [c93]Roman Barták, Jindrich Vodrázka:
The Effect of Domain Modeling on Efficiency of Planning. ISAIM 2016 - [c92]Lukás Chrpa, Roman Barták:
Guiding Planning Engines by Transition-Based Domain Control Knowledge. KR 2016: 545-548 - [c91]Roman Barták, Vladislav Kubon:
Using a Grammar Checker to Validate Compliance of Processes with Workflow Models. MICAI (1) 2016: 317-331 - [c90]Roman Barták, Tomás Dvorák:
On Verification of Workflow and Planning Domain Models Using Attribute Grammars. MICAI (1) 2016: 332-345 - [c89]Roman Barták, Marek Vlk:
Hierarchical Task Model for Resource Failure Recovery in Production Scheduling. MICAI (1) 2016: 362-378 - [c88]Jan Jelínek, Roman Barták:
Using Constraint Logic Programming to Schedule Solar Array Operations on the International Space Station. PADL 2016: 3-12 - [c87]Roman Barták:
Using Attribute Grammars to Model Nested Workflows with Extra Constraints. SOFSEM 2016: 171-182 - 2015
- [c86]Roman Barták, Jindrich Vodrázka:
Searching for Sequential Plans Using Tabled Logic Programming. RCRA@AI*IA 2015: 24-38 - [c85]Jan Skoda, Roman Barták:
Camera-Based Localization and Stabilization of a Flying Drone. FLAIRS 2015: 372-378 - [c84]Roman Barták, Marek Vlk:
Reactive Recovery from Machine Breakdown in Production Scheduling with Temporal Distance and Resource Constraints. ICAART (2) 2015: 119-130 - [c83]Roman Barták, Marek Vlk:
Machine Breakdown Recovery in Production Scheduling with Simple Temporal Constraints. ICAART (Revised Selected Papers) 2015: 185-206 - [c82]Roman Barták, Adam Vykovsky:
Any Object Tracking and Following by a Flying Drone. MICAI (Special Sessions) 2015: 35-41 - [c81]Filip Matzner, Roman Barták:
Short-Term Motion Tracking Using Inexpensive Sensors. MICAI (2) 2015: 583-601 - [c80]Roman Barták, Agostino Dovier, Neng-Fa Zhou:
On modeling planning problems in tabled logic programming. PPDP 2015: 31-42 - [c79]Tomás Balyo, Roman Barták:
No One SATPlan Encoding To Rule Them All. SOCS 2015: 146-150 - [c78]Roman Barták, Jindrich Vodrázka:
The effect of domain modeling on efficiency of planning: Lessons from the Nomystery domain. TAAI 2015: 433-440 - 2014
- [c77]Martin Cerný, Cyril Brom, Roman Barták, Martin Antos:
Spice It Up! Enriching Open World NPC Simulation Using Constraint Satisfaction. AIIDE 2014 - [c76]Jindrich Vodrázka, Roman Barták:
On Modeling Formalisms for Automated Planning. AIMSA 2014: 270-277 - [c75]Otakar Trunda, Roman Barták:
Determining a Proper Initial Configuration of Red-Black Planning by Machine Learning. MetaSel@ECAI 2014: 51-52 - [c74]Roman Barták, Andrej Hrasko, David Obdrzálek:
On Autonomous Landing of AR.Drone: Hands-On Experience. FLAIRS 2014 - [c73]Roman Barták, David Obdrzálek:
Special Track on Intelligent Autonomous Systems. FLAIRS 2014 - [c72]Filip Dvorak, Roman Barták, Arthur Bit-Monnot, Félix Ingrand, Malik Ghallab:
Planning and Acting with Temporal and Hierarchical Decomposition Models. ICTAI 2014: 115-121 - [c71]Martin Kolombo, Roman Barták:
A Constraint-Based Planner for Mars Express Orbiter. MICAI (2) 2014: 451-463 - 2013
- [c70]Roman Barták:
Simplifying Verification of Nested Workflows with Extra Constraints. FLAIRS 2013 - [c69]Roman Barták, Cyril Brom, Martin Cerný, Jakub Gemrot:
Planning and Reactive Agents in Dynamic Game Environments - An Experimental Study. ICAART (1) 2013: 234-240 - [c68]Otakar Trunda, Roman Barták:
Using Monte Carlo Tree Search to Solve Planning Problems in Transportation Domains. MICAI (2) 2013: 435-449 - [c67]Roman Barták, Neng-Fa Zhou:
On Modeling Planning Problems: Experience from the Petrobras Challenge. MICAI (2) 2013: 466-477 - [c66]Filip Dvorak, Daniel Toropila, Roman Barták:
Towards AI Planning Efficiency: Finite-Domain State Variable Reformulation. SARA 2013 - 2012
- [c65]Rudolf Kadlec, Csaba Tóth, Martin Cerný, Roman Barták, Cyril Brom:
Planning Is the Game: Action Planning as a Design Tool and Game Mechanism. AIIDE 2012 - [c64]Andrej Chovanec, Roman Barták:
Decomposition, Merging, and Refinement Approach to Boost Inductive Logic Programming Algorithms. AIMSA 2012: 184-194 - [c63]Roman Barták, Milan Jaska, Ladislav Novak, Vladimír Rovenský, Tomás Skalický, Martin Cully, Con Sheahan, Thanh-Tung Dang:
FlowOpt: Bridging the Gap Between Optimization Technology and Manufacturing Planners. ECAI 2012: 1003-1004 - [c62]Roman Barták, Filip Dvorak, Jakub Gemrot, Cyril Brom, Daniel Toropila:
When Planning Should Be Easy: On Solving Cumulative Planning Problems. FLAIRS 2012 - [c61]Roman Barták:
On Complexity of Verifying Nested Workflows with Extra Constraints. ICAART (1) 2012: 346-354 - [c60]Daniel Toropila, Filip Dvorak, Otakar Trunda, Martin Hanes, Roman Barták:
Three Approaches to Solve the Petrobras Challenge: Exploiting Planning Techniques for Solving Real-Life Logistics Problems. ICTAI 2012: 191-198 - [c59]Tomás Balyo, Roman Barták, Pavel Surynek:
Shortening Plans by Local Re-planning. ICTAI 2012: 1022-1028 - [c58]Roman Barták, Vladimír Rovenský:
Verifying Nested Workflows with Extra Constraints. MICAI (1) 2012: 359-370 - [c57]Tomás Balyo, Roman Barták, Pavel Surynek:
On Improving Plan Quality via Local Enhancements. SOCS 2012: 154-156 - [c56]Roman Barták, Con Sheahan, Ann Sheahan:
MAK€- A System for Modelling, Optimising, and Analyzing Production in Small and Medium Enterprises. SOFSEM 2012: 600-611 - 2011
- [c55]Roman Barták:
A Novel Constraint Model for Parallel Planning. FLAIRS 2011 - [c54]Roman Barták, Michal Zerola, Stanislav Slusny:
Towards Routing for Autonomous Robots - Using Constraint Programming in an Anytime Path Planner. ICAART (1) 2011: 313-320 - [c53]Andrej Chovanec, Roman Barták:
Boosting Inductive Logic Programming via Decomposition, Merging, and Refinement. ICTAI 2011: 914-915 - [c52]Andrej Chovanec, Roman Barták:
On Generating Templates for Hypothesis in Inductive Logic Programming. MICAI (1) 2011: 162-173 - [c51]Roman Barták:
On Constraint Models for Parallel Planning: The Novel Transition Scheme. SCAI 2011: 50-59 - 2010
- [c50]Roman Barták, Ondrej Kuzelka, Filip Zelezný:
Formulating Template Consistency in Inductive Logic Programming as a Constraint Satisfaction Problem. Abstraction, Reformulation, and Approximation 2010 - [c49]Roman Barták:
Constraint Models for Reasoning on Unification in Inductive Logic Programming. AIMSA 2010: 101-110 - [c48]Roman Barták, Ondrej Kuzelka, Filip Zelezný:
Using Constraint Satisfaction for Learning Hypotheses in Inductive Logic Programming. FLAIRS 2010 - [c47]Filip Dvorak, Roman Barták:
Integrating Time and Resources into Planning. ICTAI (2) 2010: 71-78 - [c46]Roman Barták:
Optimizing Alternatives in Precedence Networks. MICAI (1) 2010: 197-208 - 2009
- [c45]Roman Barták:
Tutorial: constraint-based scheduling. CISched 2009 - [c44]Roman Barták, Daniel Toropila:
Constraint Models for Sequential Planning. CPAIOR 2009: 314-315 - [c43]Roman Barták:
Special Track on Artificial Intelligence Planning and Scheduling. FLAIRS 2009 - [c42]Roman Barták, Daniel Toropila:
Enhancing Constraint Models for Planning Problems. FLAIRS 2009 - [c41]Michal Zerola, Michal Sumbera, Jérôme Lauret, Roman Barták:
Efficient multi-site data movement in distributed environment. GRID 2009: 171-172 - [c40]Michal Zerola, Michal Sumbera, Roman Barták, Jérôme Lauret:
Using Constraint Programming to Plan Efficient Data Movement on the Grid. ICTAI 2009: 729-733 - [c39]Roman Barták, Daniel Toropila:
Revisiting Constraint Models for Planning Problems. ISMIS 2009: 582-591 - [c38]Roman Barták, Daniel Toropila:
Integrating Constraint Models for Sequential and Partial-Order Planning. SARA 2009 - [c37]Lukás Chrpa, Roman Barták:
Reformulating Planning Problems by Eliminating Unpromising Actions. SARA 2009 - 2008
- [c36]Roman Barták, Ondrej Cepek:
Nested Precedence Networks with Alternatives: Recognition, Tractability, and Models. AIMSA 2008: 235-246 - [c35]Roman Barták, Daniel Toropila:
Reformulating Constraint Models for Classical Planning. FLAIRS 2008: 525-530 - [c34]Lukás Chrpa, Roman Barták:
Towards Getting Domain Knowledge: Plans Analysis through Investigation of Actions Dependencies. FLAIRS 2008: 531-536 - [c33]Roman Barták, Ondrej Cepek:
Nested temporal networks with alternatives: recognition and tractability. SAC 2008: 156-157 - [c32]Lukás Chrpa, Roman Barták:
Looking for Planning Problems Solvable in Polynomial Time via Investigation of Structures of Action Dependencies. SCAI 2008: 175-180 - 2007
- [c31]Roman Barták, Ondrej Cepek, Pavel Surynek:
Modelling Alternatives in Temporal Networks. CISched 2007: 129-136 - [c30]Roman Barták, Ondrej Cepek, Martin Hejna:
Temporal Reasoning in Nested Temporal Networks with Alternatives. CSCLP 2007: 17-31 - [c29]Pavel Surynek, Roman Barták:
Maintaining Arc-Consistency over Mutex Relations in Planning Graphs during Search. FLAIRS 2007: 134-139 - [c28]Roman Barták, Ondrej Cepek:
Temporal Networks with Alternatives: Complexity and Model. FLAIRS 2007: 641-646 - [c27]Roman Barták:
Generating Implied Boolean Constraints Via Singleton Consistency. SARA 2007: 50-63 - 2006
- [c26]Roman Barták, Ondrej Cepek:
Incremental Maintenance of Double Precedence Graphs: A Constraint-Based Approach. ICAPS 2006: 350-353 - [c25]Roman Barták, Ondrej Cepek:
A Constraint Model for State Transitions in Disjunctive Resources. CSCLP 2006: 48-62 - [c24]Roman Barták:
Incremental Propagation of Time Windows on Disjunctive Resources. FLAIRS 2006: 25-30 - [c23]Roman Barták, Ondrej Cepek:
Incremental Filtering Algorithms for Precedence and Dependency Constraints. ICTAI 2006: 416-426 - 2005
- [c22]Pavel Cejnar, Roman Barták:
Automated Search for Heuristic Functions. CP 2005: 843 - [c21]Pavel Surynek, Roman Barták:
Encoding HTN Planning as a Dynamic CSP. CP 2005: 868 - [c20]Josef Zlomek, Roman Barták:
Full Arc Consistency in WCSP and in Constraint Hierarchies with Finite Domains. CP 2005: 876 - [c19]Roman Barták:
On Generators of Random Quasigroup Problems. CSCLP 2005: 164-178 - [c18]Roman Barták, Pavel Surynek:
An Improved Algorithm for Maintaining Arc Consistency in Dynamic Constraint Satisfaction Problems. FLAIRS 2005: 161-166 - [c17]Marius-Calin Silaghi, Amit Abhyankar, Markus Zanker, Roman Barták:
Desk-Mates (Stable Matching) with Privacy of Preferences, and a New Distributed CSP Framework. FLAIRS 2005: 671-677 - [c16]Roman Barták, Hana Rudová:
Limited assignments: a new cutoff strategy for incomplete depth-first search. SAC 2005: 388-392 - 2004
- [c15]Petr Vilím, Roman Barták, Ondrej Cepek:
Unary Resource Constraint with Optional Activities. CP 2004: 62-76 - [c14]Pavel Surynek, Roman Barták:
A New Algorithm for Maintaining Arc Consistency After Constraint Retraction. CP 2004: 767-771 - [c13]Roman Barták, Radek Erben:
A New Algorithm for Singleton Arc Consistency. FLAIRS 2004: 257-262 - [c12]Tomás Müller, Hana Rudová, Roman Barták:
Minimal Perturbation Problem in Course Timetabling. PATAT 2004: 126-146 - [c11]Roman Barták:
Effective Modeling with Constraints. INAP/WLP 2004: 149-165 - 2003
- [c10]Roman Barták, Roman Mecl:
Implementing Propagators for Tabular Constraints. CSCLP 2003: 44-65 - [c9]Roman Barták, Tomás Müller, Hana Rudová:
A New Approach to Modeling and Solving Minimal Perturbation Problems. CSCLP 2003: 233-249 - 2002
- [c8]Petr Vilím, Roman Barták:
Filtering Algorithms for Batch Processing with Sequence Dependent Setup Times. AIPS 2002: 312-321 - [c7]Roman Barták:
Visopt ShopFloor: Going Beyond Traditional Scheduling. International Workshop on Constraint Solving and Constraint Logic Programming 2002: 185-199 - [c6]Roman Barták:
Visopt ShopFloor: On the Edge of Planning and Scheduling. CP 2002: 587-602 - [c5]Roman Barták:
A Theoretical Framework for Constraint Hierarchy Solvers. ECAI 2002: 146-150 - [c4]Roman Barták:
Modelling Resource Transitions in Constraint-Based Scheduling. SOFSEM 2002: 186-194 - 2000
- [c3]Roman Barták:
Mixing Planning and Scheduling to Model Complex Process Environments. PACPL 2000: 329-332 - 1999
- [c2]Roman Barták:
Dynamic Constraint Models for Planning and Scheduling Problems. New Trends in Constraints 1999: 237-255 - 1997
- [c1]Roman Barták:
A Plug-In Architecture of Constraint Hierarchy Solvers. PACT 1997: 359-372
Parts in Books or Collections
- 2014
- [p1]Roman Barták:
Planning and Scheduling. Computing Handbook, 3rd ed. (1) 2014: 39: 1-14
Editorship
- 2023
- [e7]Roman Barták, Wheeler Ruml, Oren Salzman:
Sixteenth International Symposium on Combinatorial Search, SOCS 2023, July 14-16, 2023, Prague, Czech Republic. AAAI Press 2023 [contents] - 2022
- [e6]Roman Barták, Fazel Keshtkar, Michael Franklin:
Proceedings of the Thirty-Fifth International Florida Artificial Intelligence Research Society Conference, FLAIRS 2022, Hutchinson Island, Jensen Beach, Florida, USA, May 15-18, 2022. 2022 [contents] - 2020
- [e5]Roman Barták, Eric Bell:
Proceedings of the Thirty-Third International Florida Artificial Intelligence Research Society Conference, Originally to be held in North Miami Beach, Florida, USA, May 17-20, 2020. AAAI Press 2020, ISBN 978-1-57735-821-3 [contents] - 2019
- [e4]Roman Barták, Keith W. Brawner:
Proceedings of the Thirty-Second International Florida Artificial Intelligence Research Society Conference, Sarasota, Florida, USA, May 19-22 2019. AAAI Press 2019 [contents] - 2016
- [e3]Roman Barták, Thomas Leo McCluskey, Enrico Pontelli:
Proceedings of the Workshop on Knowledge-based Techniques for Problem Solving and Reasoning co-located with 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), New York City, USA, July 10, 2016. CEUR Workshop Proceedings 1648, CEUR-WS.org 2016 [contents] - 2014
- [e2]Stefan Edelkamp, Roman Barták:
Proceedings of the Seventh Annual Symposium on Combinatorial Search, SOCS 2014, Prague, Czech Republic, 15-17 August 2014. AAAI Press 2014, ISBN 978-1-57735-676-9 [contents] - 2005
- [e1]Roman Barták, Michela Milano:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Second International Conference, CPAIOR 2005, Prague, Czech Republic, May 30 - June 1, 2005, Proceedings. Lecture Notes in Computer Science 3524, Springer 2005, ISBN 3-540-26152-4 [contents]
Reference Works
- 2009
- [r1]Roman Barták:
Constraint Processing. Encyclopedia of Artificial Intelligence 2009: 404-409
Informal and Other Publications
- 2024
- [i11]Tomás Balyo, Martin Suda, Lukás Chrpa, Dominik Safránek, Filip Dvorák, Roman Barták, G. Michael Youngblood:
Learning Planning Action Models from State Traces. CoRR abs/2402.10726 (2024) - [i10]Tomás Balyo, G. Michael Youngblood, Filip Dvorák, Roman Barták:
On Automating Video Game Testing by Planning and Learning. CoRR abs/2402.12393 (2024) - 2019
- [i9]Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Eli Boyarski, Roman Barták:
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. CoRR abs/1906.08291 (2019) - 2015
- [i8]Neng-Fa Zhou, Roman Barták, Agostino Dovier:
Planning as Tabled Logic Programming. CoRR abs/1507.03979 (2015) - 2014
- [i7]Roman Barták, Neng-Fa Zhou:
Using Tabled Logic Programming to Solve the Petrobras Planning Problem. CoRR abs/1405.2501 (2014) - 2009
- [i6]Michal Zerola, Jérôme Lauret, Roman Barták, Michal Sumbera:
Using constraint programming to resolve the multi-source/multi-site data movement paradigm on the Grid. CoRR abs/0901.0148 (2009) - [i5]Michal Zerola, Jérôme Lauret, Roman Barták, Michal Sumbera:
Efficient Multi-site Data Movement Using Constraint Programming for Data Hungry Science. CoRR abs/0906.2914 (2009) - 2006
- [i4]Timothy Atkinson, Roman Barták, Marius-Calin Silaghi, E. Tuleu, Markus Zanker:
Private and Efficient Stable Marriages (Matching). IACR Cryptol. ePrint Arch. 2006: 345 (2006) - 2001
- [i3]Tomás Müller, Roman Barták:
Interactive Timetabling. CoRR cs.PL/0109022 (2001) - [i2]Roman Barták:
Dynamic Global Constraints: A First View. CoRR cs.PL/0109025 (2001) - [i1]Krzysztof R. Apt, Roman Barták, Éric Monfroy, Francesca Rossi, Sebastian Brand:
Proceedings of the 6th Annual Workshop of the ERCIM Working Group on Constraints. CoRR cs.PL/0110012 (2001)
Coauthor Index
a service of 
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-07 22:31 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:
