Roman Barták
Also known as Roman Bartak
Roman Barták researches automated planning, scheduling and constraint methods at Charles University. He earned his computer science PhD in 1997 and became a full professor in 2013. He coauthored scheduling algorithms for optional activities, led the FlowOpt scheduling system and studied verification of hierarchical plans. His broader work includes coordinated paths for multiple robots. AAAI elected him a fellow in 2026 for constraint-based planning and scheduling and education.
- Now at
- Charles University
- Works
- 356
- Citations
- 2,625
- h-index
- 22
Publication numbers from OpenAlex, as of 14 October 2026.
Timeline
-
1997
Doctoral work and academic research
Barták earned his computer science PhD at Charles University in 1997. His research centers on automated planning, scheduling, constraint satisfaction and knowledge representation. He became a full professor in 2013.
-
2004
Constraints for scheduling
With Petr Vilím and Ondřej Čepek, Barták developed filtering algorithms for resource constraints with optional activities. The algorithms support scheduling alternative processes. The shared paper received a CP 2004 Best Paper Award.
-
2012–2018
Scheduling systems and plan checks
Barták led the team developing FlowOpt, a scheduling system with an editor, scheduler and interactive rescheduling tools. Later work with Adrien Maillard and Rafael Cardoso studied formal verification for hierarchical temporal plans. His FlowOpt and plan-verification projects date to 2012 and 2018, respectively.
-
2026
Recognition for planning and education
AAAI elected Barták a fellow for constraint-based planning and scheduling techniques and sustained education. He also works on multi-agent path finding and tests planning ideas with real robots.
Sources and credits
Photo: ktiml.mff.cuni.cz; Roman Barták profile photograph; creator not stated. License: Not stated by source. Source: ktiml.mff.cuni.cz. Cropped to a square and resized. Ask us to remove or replace this photo.