Active learning of plans for safety and reachability goals with partial observability

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 40, Issue 2, 2010, Pages 412-420

  Nam, Wonhong ^a   Alur, Rajeev ^b  

^a Konkuk University   (South Korea)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

Active learning; Automated planning; Partial observability; Symbolic model checking

Indexed keywords

ACTIVE LEARNING; ACTIVE-LEARNING ALGORITHM; ALTERNATING TIME TEMPORAL LOGIC; AUTOMATED PLANNING; NOVEL SOLUTIONS; PARTIAL OBSERVABILITY; PLANNING DOMAINS; PLANNING METHOD; REACHABILITY; REGULAR LANGUAGES; SAFETY PROPERTY; SYMBOLIC MODEL CHECKING; TRADITIONAL PLANNING;

LEARNING ALGORITHMS; LINGUISTICS; OBSERVABILITY; TEMPORAL LOGIC;

MODEL CHECKING;

EID: 77949772591     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2009.2025657     Document Type: Article

References (45)

1. R. Fikes and N. Nilsson, "STRIP: A new approach to the application of theorem proving to problem solving," Artif. Intell., vol. 2, no. 3/4, pp. 189-208, 1971.
2. J. Penberthy and D. Weld, "UCPOP: A sound, complete, partial-order planner for ADL," in Proc. 3rd Int. Conf. KR, 1992, pp. 103-114.
3. A. Cimatti, M. Pistore, M. Roveri, and P. Traverso, "Weak, strong, and strong cyclic planning via symbolic model checking," Artif. Intell., vol. 147, no. 1/2, pp. 35-84, Jul. 2003.
4. F. Bacchus and F. Kabanza, "Planning for temporally extended goals," Ann. Math. Artif. Intell., vol. 22, no. 1/2, pp. 5-27, 1998.
5. S. Cerrito and M. Mayer, "Bounded model search in linear temporal logic and its application to planning," in Proc. 7th Int. Conf. Analytic Tableaux Related Methods, 1998, pp. 124-140.
6. J. Kvarnstrom and P. Doherty, "TALplanner: A temporal-logic-based forward chaining planner," Ann. Math. Artif. Intell., vol.30, no.1-4, pp. 119-169, 2001.
7. M. Postore and P. Traverso, "Planning as model checking for extended goals in nondeterministic domains," in Proc. 17th IJCAI, 2001, pp. 479-486.
8. D. Calvanese, G. de Giacomo, and M. Vardi, "Reasoning about action and planning in LTL action theories," in Proc. 8th Int. Conf. KR, 2002, pp. 593-602.
9. D. Weld, C. Anderson, and D. Smith, "Extending Graphplan to handle uncertainty and sensing actions," in Proc. 15th Nat. Conf. Artif. Intell. (AAAI), 1998, pp. 897-904.
10. J. Rintanen, "Constructing conditional plans by a theorem prover," J. Artif. Intell. Res., vol.10, pp. 323-352, 1999.
11. B. Bonet and H. Geffner, "Planning with incomplete information as heuristic search in belief space," in Proc. AIPS, 2000, pp. 52-61.
12. P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso, "Planning in nondeterministic domains under partial observability via symbolic model checking," in Proc. 17th IJCAI, 2001, pp. 473-478.
13. D. Angluin, "Learning regular sets from queries and counterexamples," Inf. Comput., vol.75, no.2, pp. 87-106, Nov. 1987.
14. R. Rivest and R. Schapire, "Inference of finite automata using homing sequences," Inf. Comput., vol.103, no.2, pp. 299-347, Apr. 1993.
15. R. Alur, T. Henzinger, F. Mang, S. Qadeer, S. Rajamani, and S. Tasiran, "MOCHA: Modularity in model checking," in Proc. 10th Int. Conf. CAV, 1998, pp. 516-520.
16. R. Alur, T. Henzinger, and O. Kupferman, "Alternating-time temporal logic," J. ACM, vol.49, no.5, pp. 1-42, Sep. 2002.
17. P. Bertoli, A. Cimatti, M. Pistore, and P. Traverso, "A framework for planning with extended goals under partial observability," in Proc. 13th ICAPS, 2003, pp. 215-224.
18. P. Bertoli and M. Pistore, "Planning with extended goals and partial observability," in Proc. 14th ICAPS, 2004, pp. 270-278.
19. A. Cimatti, E. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella, "NuSMV version 2: An OpenSource tool for symbolic model checking," in Proc. 14th Int. Conf. CAV, 2002, pp. 359-364.
20. G. de Giacomo and M. Vardi, "Automata-theoretic approach to planning with temporally extended goals," in Proc. 5th ECP, 1999, pp. 35-48.
21. L. Pryor and G. Collins, "Planning for contingency: A decision-based approach," J. Artif. Intell. Res., vol.4, pp. 81-120, 1996.
22. F. Kabanza, M. Barbeau, and R. St-Denis, "Planning control rules for reactive agents," Artif. Intell., vol.95, no.1, pp. 67-113, Aug. 1997.
23. A. Cimatti, M. Roveri, and P. Traverso, "Automatic OBDD-based generation of universal plans in nondeterministic domains," in Proc. 15th Nat. Conf. Artif. Intell. (AAAI), 1998, pp. 875-881.
24. A. Cimatti, F. Giunchiglia, E. Giunchiglia, and P. Traverso, "Planning via model checking: A decision procedure for AR," in Proc. 4th ECP, 1997, pp. 130-142.
25. E. Asarin, O. Maler, and A. Pnueli, "Symbolic controller synthesis for discrete and timed systems," in Hybrid Systems II. New York: Springer- Verlag, 1995, pp. 1-20.
26. O. Kupferman and M. Vardi, "Synthesis with incomplete information," in Proc. 2nd Int. Conf. Temporal Logic, 1997, pp. 91-106.
27. F. Bacchus and F. Kabanza, "Using temporal logic to express search control knowledge for planning," Artif. Intell., vol. 116, no. 1/2, pp. 123- 191, Jan. 2000.
28. M. Postore, R. Bettin, and P. Traverso, "Symbolic techniques for planning with extended goals in nondeterministic domains," in Proc. 6th ECP, 2001, pp. 253-264.
29. J. Liu and H. Darabi, "Control reconfiguration of discrete event systems controllers with partial observation," IEEE Trans. Syst., Man, Cybern. B: Cybern., vol.34, no.6, pp. 2262-2272, Dec. 2004.
30. G. Alpan and M. A. Jafari, "Synthesis of a closed-loop combined plant and controller model," IEEE Trans. Syst., Man, Cybern. B: Cybern., vol.32, no.2, pp. 163-175, Apr. 2002.
31. P. Vrancx, K. Verbeeck, and A. Nowé, "Decentralized learning in Markov games," IEEE Trans. Syst., Man, Cybern. B: Cybern., vol.38, no.4, pp. 976-981, Aug. 2008.
32. L. Karlsson, "Conditional progressive planning under uncertainty," in Proc. 17th IJCAI, 2001, pp. 431-438.
33. J. Pineau and G. J. Gordon, "POMDP planning for robust robot control," in Proc. 12th ISRR, 2005, pp. 69-82.
34. T. Jaakkola, S. P. Singh, and M. I. Jordan, "Reinforcement learning algorithm for partially observable Markov decision problems," in Proc. NIPS 7, 1994, pp. 345-352.
35. O. Ibarra and T. Jiang, "Learning regular languages from counterexamples," J. Comput. Syst. Sci., vol.43, no.2, pp. 299-316, Oct. 1991.
36. A. Birkendorf, A. Böker, and H.-U. Simon, "Learning deterministic finite automata from smallest counterexamples," SIAM J. Discrete Math., vol.13, no.4, pp. 465-491, Oct. 2000.
37. M. Kearns and U. Vazirani, An Introduction to Computational Learning Theory. Cambridge, MA: MIT Press, 1994.
38. M. Fabian, Discrete Event Systems. Gothenburg, Sweden: Chalmers Univ. Technol., 2006.
39. W. Wonham, Notes on Control of Discrete-Event Systems. Toronto, ON, Canada: Univ. Toronto, 1999.
40. Z. Zhang andW.Wonham, "STCT: An efficient algorithm for supervisory control design," in Proc. SCODES, 2001, pp. 82-93.
41. A. Tanenbaum, Modern Operating Systems. Englewood Cliffs, NJ: Prentice-Hall, 1992.
42. P. Bertoli, A. Cimatti, M. Pistore, M. Roveri, and P. Traverso, "MBP: A model-based planner," in Proc. IJCAI Workshop Planning Under Uncertainty Incomplete Inf., 2001, pp. 93-97.
43. R. Alur, P. Madhusudan, and W. Nam, "Symbolic compositional verification by learning assumptions," in Proc. 17th Int. Conf. CAV, 2005, pp. 548-562.
44. W. Nam, P. Madhusudan, and R. Alur, "Automatic symbolic compositional verification by learning assumptions," Form. Methods Syst. Des., vol.32, no.3, pp. 207-234, Jun. 2008.
45. D. McDermott, "PDDL: The planning domain definition language," Yale Center Comput. Vis. Control, New Haven, CT, Tech. Rep., CVC TR-98-1003, 1989.