Abstract
ABSTRACTThis paper introduces graph-rewriting methodology for robotic task planning. An approach to represent a high-level task plan in the form of a graph and modify it to accommodate various planning strategies is proposed. Explicitly delineated graph-rewrite rules and their ordered applications are used to reflect the change in plans by changing the graph topology. A framework for modeling complex manipulation tasks as interconnection of simpler subtasks and events connecting them is presented. Using a simple example, it is demonstrated how various plans can dynamically evolve as a function of events. The advantages of graph-rewriting methodology in task planning, importance of developing a reusable graph-rewrite rule library for manipulation tasks, and its connection to low-level control are also outlined in this introductory paper.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
