Planning a typical working day for indoor service robots

IAENG International Journal of Computer Science

Volumn 38, Issue 3, 2011, Pages 176-182

  Gorbenko, Anna ^a   Mornev, Maxim ^a   Popov, Vladimir ^a  

^a URAL FEDERAL UNIVERSITY   (Russian Federation)

Author keywords

Hamiltonian path problem; Planning algorithms; Satisfiability problem; Theory of actions

Indexed keywords

EID: 80053646188     PISSN: 1819656X     EISSN: 18199224     Source Type: Journal    
DOI: None     Document Type: Article

References (46)

1. P. Bertoli, M. Pistore, and P. Traverso, "Automated composition of Web services via planning in asynchronous domains," Artificial Intelligence, vol. 174, no. 3-4, pp. 316-361, March 2010.
2. S. Srivastava, N. Immerman, and S. Zilberstein, "A new representation and associated algorithms for generalized planning," Artificial Intelligence, vol. 175, no. 2, pp. 615-647, February 2011.
3. K. Wang and S. H. Choi, "Decomposition-Based Scheduling for Makespan Minimisation of Flexible Flow Shop with Stochastic Processing Times," Engineering Letters, vol. 18, no. 1, EL-18-1-09, February 2010.
4. F. Wu, S. Zilberstein, and X. Chen, "Online planning for multi-agent systems with bounded communication," Artificial Intelligence, vol. 175, no. 2, pp. 487-511, February 2011.
5. M. Zhongyi, M. Younus, and L. Yongjin, "Automated Planning and Scheduling System for the Composite Component Manufacturing Workshop," Engineering Letters, vol. 19, no. 1, pp. 75-83, February 2011.
6. G. B. Dantzig and J. H. Ramser, "The Truck Dispatching Problem," Management Science, vol. 6, no. 1, pp. 80-91, October 1959.
7. A. Boonkleaw, N. Suthikamnarunai, and R. Srinon, "Strategic Planning for Newspaper Delivery Problem Using Vehicle Routing Algorithm with Time Window (VRPTW)," Engineering Letters, vol. 18, no. 2, EL-18-2-09, May 2010.
8. G. Koloch and B. Kaminski, "Nested vs. Joint Optimization of Vehicle Routing Problems with Three-dimensional Loading Constraints," Engineering Letters, vol. 18, no. 2, EL-18-2-10, May 2010.
9. L. Lian and E. Castelain, "A Decomposition Approach to Solve a General Delivery Problem," Engineering Letters, vol. 18, no. 1, EL-18-1-10, February 2010.
10. X. Zheng, S. Koenig, D. Kempe, and S. Jain, "Multi-Robot Forest Coverage for Weighted and Unweighted Terrain," IEEE Transactions on Robotics, vol. 26, no. 6, pp. 1018-1031, November 2010.
11. S. Koenig, J. Mitchell, A. Mudgal, and C. Tovey, "A Near-Tight Approximation Algorithm for the Robot Localization Problem," SIAM Journal on Computing, vol. 39, no. 2, pp. 461-490, March 2009.
12. C. Tovey and S. Koenig, "Localization: Approximation and Performance Bounds to Minimize Travel Distance," IEEE Transactions on Robotics, vol. 26, no. 2, pp. 320-330, March 2010.
13. X. Zheng and S. Koenig, "K-Swaps: Cooperative Negotiation for Solving Task-Allocation Problems," in Proceedings of the 2009 International Joint Conference on Artificial Intelligence, pp. 373-379.
14. J.-W. Choi, R. E. Curry, and G. H. Elkaim, "Continuous Curvature Path Generation Based on Bezier Curves for Autonomous Vehicles," IAENG International Journal of Applied Mathematics, vol. 40, no. 2, IJAM-40-2-07, May 2010.
15. K. Daniel, A. Nash, S. Koenig, and A. Felner, "Theta*: Any-Angle Path Planning on Grids," Journal of Artificial Intelligence Research, vol. 39, pp. 533-579, September 2010.
16. A. Nash, S. Koenig, and M. Likhachev, "Incremental Phi*: Incremental Any-Angle Path Planning on Grids," in Proceedings of the 2009 International Joint Conference on Artificial Intelligence, 1824-1830.
17. P. Sotiropoulos, N. Aspragathos, and F. Andritsos, "Optimum Docking of an Unmanned Underwater Vehicle for High Dexterity Manipulation," IAENG International Journal of Computer Science, vol. 38, no. 1, pp. 48-56, February 2011.
18. W. Yue and J. Franco, "A New Way to Reduce Computing in Navigation Algorithm," Engineering Letters, vol. 18, no. 4, EL-18-4-03, November 2010.
19. R. Borie, C. Tovey, and S. Koenig, "Algorithms and Complexity Results for Pursuit-Evasion Problems," in Proceedings of the 2009 International Joint Conference on Artificial Intelligence, pp. 59-66.
20. M. Bienvenu, C. Fritz, S. A. McIlraith, "Specifying and computing preferred plans," Artificial Intelligence, vol. 175, no. 7-8, pp. 1308-1345, May 2011.
21. M. Sridharan, J. Wyatt, R. Dearden, "Planning to see: A hierarchical approach to planning visual actions on a robot using POMDPs," Artificial Intelligence, vol. 174, no. 11, pp. 704-725, July 2010.
22. M. Thielscher, "A unifying action calculus," Artificial Intelligence, vol. 175, no. 1, pp. 120-141, January 2011.
23. P. H. Tu, T. C. Son, M. Gelfond, A. R. Morales, "Approximation of action theories and its application to conformant planning," Artificial Intelligence, vol. 175, no. 1, pp. 79-119, January 2011.
24. Website of Robotic Industries Association -Robotics Online. [Online]. Available: http://www.robotics.org/
25. Website of International Federation of Robotics. [Online]. Available: http://www.ifr.org/home/
26. M. R. Garey and D. S. Johnson, Computers and Intractability. A Guide to the Theory of NP-completeness. San Francisco, California, USA: W. H. Freeman and Co, 1979.
27. J. Gu, P. Purdom, J. Franco, and B. Wah, "Algorithms for the Satisfiability (SAT) Problem: A Survey," in DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1996, pp. 19-152.
28. J. Fleurent, "Genetic algorithms and hybrids for graph coloring," Annals of Operations Research, vol. 63, no. 3, pp. 437-461, June 1996. (Pubitemid 126729251)
29. J. Hao, R. Dome, "A new population-based method for satisfiability problems," in Proceedings of 11th European Conference on Artificial Intelligence, 1994, pp. 135-139.
30. K. Jong, W. Spears, "Using genetic algorithms to solve np-complete problems," in Proceedings of the International Conference on Genetic Algorithms, 1989, pp. 124-132.
31. R. Voorn, M. Dastani, E. Marchiori, "Finding simplest pattern structures using genetic programming," in Proceedings of the Genetic and Evolutionary Computation Conference, 2001, pp. 3-10.
32. J. Hao, F. Lardeux, F. Saubion, "A hybrid genetic algorithm for the satisfiability problem," in Proceedings of the 1rst International Workshop on Heuristics, 2002, pp. 102-109.
33. C. Bessiere, E. Hebrard, and T. Walsh, "Local Consistencies in SAT," in Theory and applications of satisfiability testing: SAT 2003: international conference on theory and applications of satisfiability testing N 6, 2003, pp. 400-407.
34. M. Davis, G. Logemann, and D. Loveland, "A Machine Program for Theorem Proving," Communications of the ACM, vol. 5, no. 7, pp. 394-397, July 1962.
35. A. Frisch, and T. Peugniez, "Solving Non-Boolean Satisfiability Problems with Stochastic Local Search," in Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence, 2001, pp. 282-288.
36. A. M. Frisch, T. J. Peugniez, A. J. Doggett, and P. W. Nightingale, "Solving Non-Boolean Satisfiability Problems with Stochastic Local Search: A Comparison of Encodings," Journal of Automated Reasoning, vol. 35, no. 1-3, pp. 143-179, March 2005.
37. K. Iwama and S. Miyazaki, "SAR-variable complexity of hard combinatorial problems," in Information Processing 94, IFIP Transactions A, Computer Science and Technology, vol. 1, pp. 253-258.
38. M. Büttner, and J. Rintanen, "Improving parallel planning with constraints on the number of operators," in Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling, 2005, pp. 292-299.
39. M. Ernst, T. Millstein, and D. Weld, "Automatic SAT-Compilation of Planning Problems," in Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1997, pp. 1169-1176.
40. H. Kautz, "SATPLAN04: Planning as Satisfiability," in Proceedings of the 4th International Planning Competition at the 14th International Conference on Automated Planning and Scheduling, 2004, pp. 44-45.
41. H. H. Hoos, "SAT-Encodings, Search Space Structure, and Local Search Performance," in Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence 1999, pp. 296-302.
42. A. D. Plotnikov, "A Logical Model of HCP," International Journal of Mathematics and Mathematical Sciences, vol. 26, no. 11, November 2001.
43. SATLIB -The Satisfiability Library. [Online]. Available: http://people.cs.ubc.ca/~hoos/SATLIB/index-ubc.html
44. Satisfiability Suggested Format. [Online]. Available: http://www.cs.ubc.ca/~hoos/SATLIB/Benchmarks/SAT/satformat.ps
45. Web page "Computational resources of IMM UB RAS". (In Russian.) [Online]. Available: http://parallel.imm.uran.ru/mvc-now/hardware/supercomp.htm
46. A. Gorbenko, A. Lutov, M. Mornev, V. Popov, "Algebras of Stepping Motor Programs," Applied Mathematical Sciences, vol. 5, no. 34, pp. 1679-1692, June 2011.