In this paper, we study the problem of distributed motion coordination among a group of nonholonomic ground robots. We develop vision-based control laws for parallel and balanced circular formations using a consensus approach. The proposed control laws are distributed in the sense that they require information only from neighboring robots. Furthermore, the control laws are coordinate-free and do not rely on measurement or communication of heading information among neighbors but instead require measurements of bearing, optical flow, and time to collision, all of which can be measured using visual sensors. Collision-avoidance capabilities are added to the team members, and the effectiveness of the control laws are demonstrated on a group of mobile robots. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. Abstract-In this paper, we study the problem of distributed motion coordination among a group of nonholonomic ground robots. We develop vision-based control laws for parallel and balanced circular formations using a consensus approach. The proposed control laws are distributed in the sense that they require information only from neighboring robots. Furthermore, the control laws are coordinate-free and do not rely on measurement or communication of heading information among neighbors but instead require measurements of bearing, optical flow, and time to collision, all of which can be measured using visual sensors. Collision-avoidance capabilities are added to the team members, and the effectiveness of the control laws are demonstrated on a group of mobile robots.
We study the problem of flocking and velocity alignment in a group of kinematic nonholonomic agents in 2 and 3 dimensions. By analyzing the velocity vectors of agents on a circle (for planar motion) or sphere (for 3-D motion), we develop a geodesic control law that minimizes a misalignment potential and results in velocity alignment and flocking. The proposed control laws are distributed and will provably result in flocking when the underlying proximity graph which represents the neighborhood relation among agents is connected. We further show that flocking is possible even when the topology of the proximity graph changes over time, so long as a weaker notion of joint connectivity is preserved. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. Distributed Geodesic Control Laws for Flocking of Nonholonomic AgentsNima Moshtagh and Ali JadbabaieAbstract-We study the problem of flocking and velocity alignment in a group of kinematic nonholonomic agents in 2 and 3 dimensions. By analyzing the velocity vectors of agents on a circle (for planar motion) or sphere (for 3-D motion), we develop a geodesic control law that minimizes a misalignment potential and results in velocity alignment and flocking. The proposed control laws are distributed and will provably result in flocking when the underlying proximity graph which represents the neighborhood relation among agents is connected. We further show that flocking is possible even when the topology of the proximity graph changes over time, so long as a weaker notion of joint connectivity is preserved.
We study the problem of flocking and velocity alignment in a group of kinematic nonholonomic agents in 2 and 3 dimensions. By analyzing the velocity vectors of agents on a circle (for planar motion) or sphere (for 3-D motion), we develop a geodesic control law that minimizes a misalignment potential and results in velocity alignment and flocking. The proposed control laws are distributed and will provably result in flocking when the underlying proximity graph which represents the neighborhood relation among agents is connected. We further show that flocking is possible even when the topology of the proximity graph changes over time, so long as a weaker notion of joint connectivity is preserved. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. Distributed Geodesic Control Laws for Flocking of Nonholonomic AgentsNima Moshtagh and Ali JadbabaieAbstract-We study the problem of flocking and velocity alignment in a group of kinematic nonholonomic agents in 2 and 3 dimensions. By analyzing the velocity vectors of agents on a circle (for planar motion) or sphere (for 3-D motion), we develop a geodesic control law that minimizes a misalignment potential and results in velocity alignment and flocking. The proposed control laws are distributed and will provably result in flocking when the underlying proximity graph which represents the neighborhood relation among agents is connected. We further show that flocking is possible even when the topology of the proximity graph changes over time, so long as a weaker notion of joint connectivity is preserved.
Abstract-We propose a biologically inspired, distributed coordination scheme based on nearest-neighbor interactions for a set of mobile kinematic agents equipped with vision sensors. It is assumed that each agent is only capable of measuring the following three quantities relative to each of its nearest neighbors (as defined by a proximity graph): time-to-collision, a single optical flow vector and relative bearing. We prove that the proposed distributed control law results in alignment of headings and flocking, even when the topology of the proximity graph representing the interconnection changes with time. It is shown that when the proximity graph is "jointly connected" over time, flocking and velocity alignment will occur. Furthermore, the distributed control law can be extended to the case where the agents follow a leader. Under similar connectivity assumptions, we prove that the headings converge to that of the leader.Simulations are presented to demonstrate the effectiveness of this approach.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.