Name
Abstract | ||
|---|---|---|
In this paper we present LP-TPOP, a domain-independent temporal partial-order planning algorithm that handles CBI-style action model. By the utilization of ground actions variable binding constraints can be eliminated from partial plans, then all the constraints needed to be handled are temporal constraints, which are maintained in a revised simple temporal constraint network (r-STN) structure. The exact scheduling of plan returned by planning phase is calculated by a linear programming module. By exploiting incremental algorithms the efficiency of LP-TPOP can be further improved. LP-TPOP is proved to be sound and complete. |
Year | DOI | Venue |
|---|---|---|
2006 | 10.1007/978-3-540-36668-3_92 | PRICAI |
Keywords | Field | DocType |
partial order,linear program,constraint programming | Constraint satisfaction,Mathematical optimization,Constraint (mathematics),Scheduling (computing),Computer science,Constraint programming,Algorithm,Stochastic process,Linear programming,Partially ordered set,Constrained optimization | Conference |
Volume | Issue | ISSN |
4099 LNAI | null | 0302-9743 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuechang Liu | 1 | 1 | 1.38 |
| Yunfei Jiang | 2 | 158 | 13.17 |