A dϕ-Strategy: Facilitating Dual-Formation Control of a Virtually Connected Team
This paper describes the design of new centralized acceleration-based controllers for the multitask problem of motion planning and control of a coordinated lead-carrier team fixed in a dual-formation within an obstacle-ridden environment. A dϕ-strategy, where d and ϕ are Euclidean measures with resp...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-01-01
|
| Series: | Journal of Advanced Transportation |
| Online Access: | http://dx.doi.org/10.1155/2017/9213805 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | This paper describes the design of new centralized acceleration-based controllers for the multitask problem of motion planning and control of a coordinated lead-carrier team fixed in a dual-formation within an obstacle-ridden environment. A dϕ-strategy, where d and ϕ are Euclidean measures with respect to the lead robot, is developed to ensure virtual connectivity of the carrier robots to the lead robot. This connectivity, built into the system itself, inherently ensures globally rigid formation between each lead-carrier pair of the team. Moreover, a combination of target configuration, dϕ-strategy, orientation consensus, and avoidance of end-effector of robots results in a second, locally rigid formation (not infinitesimally rigid). Therefore, for the first time, a dual-formation control problem of a lead-carrier team of mobile manipulators is considered. This and other kinodynamic constraints have been treated simultaneously via the overarching Lyapunov-based control scheme, essentially a potential field method favored in the field of robotics. The formulation of this new scheme, demonstrated effectively via computer simulations, is timely, given that the current proposed engineering solutions, allowing autonomous vehicles on public roads, include the development of special lanes imbued with special sensors and wireless technologies. |
|---|---|
| ISSN: | 0197-6729 2042-3195 |