Action planning for multi-robot-based reconfigurable fixture Online publication date: Wed, 19-Nov-2014
by Wojciech Szynkiewicz
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 17, No. 2/3, 2014
Abstract: The paper presents a planning system for a self-reconfigurable fixture. The fixture is a multi-agent system composed a variable number of adaptable mobile robotic agents and a workbench on which these agents can move and lock. The paper proposes an approach for the generation of a feasible action plan for the locomotion, reconfiguration, and positioning of robotic fixtures to support the thin-sheet workpiece near the operating machine-tool. The multi-agent action planning problem is converted to a constraint satisfaction problem (CSP). CSP is a computational problem where the task is to decide for a given finite set of variables and constraints whether there is an assignment to the variables that satisfies all constraints. The proposed approach called Triple-CSP applies an incremental state search to solve three hierarchical planning tasks for the three components of each mobile agent: a supporting head placement, a mobile base positioning, and a parallel kinematic machine positioning, respectively. Thus, the planner takes into account all the relevant physical, geometrical, and time constraints.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com