48 citations · 74 across the 7 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2021
Generalized Conflict-directed Search for Optimal Ordering Problems
Jingkai Chen, Yuening Zhang, Cheng Fang +1
Solving planning and scheduling problems for multiple tasks with highly coupled state and temporal constraints is notoriously challenging. An appealing approach to effectively deco…
cs.AI2019★ 1 cited
Efficiently Exploring Ordering Problems through Conflict-directed Search
Jingkai Chen, Cheng Fang, David Wang +2
In planning and scheduling, solving problems with both state and temporal constraints is hard since these constraints may be highly coupled. Judicious orderings of events enable so…