2016
DOI: 10.1115/1.4034745
|View full text |Cite
|
Sign up to set email alerts
|

Decentralized Rendezvous of Nonholonomic Robots With Sensing and Connectivity Constraints

Abstract: A group of wheeled robots with nonholonomic constraints is considered to rendezvous at a common specified setpoint with a desired orientation while maintaining network connectivity and ensuring collision avoidance within the robots. Given communication and sensing constraints for each robot, only a subset of the robots are aware or informed of the global destination, and the remaining robots must move within the network connectivity constraint so that the informed robots can guide the group to the goal. The mo… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
13
0

Year Published

2018
2018
2022
2022

Publication Types

Select...
8
1

Relationship

1
8

Authors

Journals

citations
Cited by 20 publications
(13 citation statements)
references
References 40 publications
0
13
0
Order By: Relevance
“…2 evolving over G, where Q represents the node set V, and the possible transitions δ are captured by the edge set E. The DTS T can effectively capture the robot high-level motion and greatly reduce the complexity of control design, since many existing continuous feedback controllers (cf. [37]- [39]) can translate the discrete motions over G to continuous motions in the real environment.…”
Section: A Environment and Robot Modelmentioning
confidence: 99%
“…2 evolving over G, where Q represents the node set V, and the possible transitions δ are captured by the edge set E. The DTS T can effectively capture the robot high-level motion and greatly reduce the complexity of control design, since many existing continuous feedback controllers (cf. [37]- [39]) can translate the discrete motions over G to continuous motions in the real environment.…”
Section: A Environment and Robot Modelmentioning
confidence: 99%
“…), they may give way to undesirable behavior, such as oscillations. In [7] and [8] a navigation-function-based time-varying controller with connectivity maintenance is proposed, respectively, for undirected and directed graphs; nevertheless, it presents some problems inherent to the navigation-function framework such as local minima and the need to have a bounded workspace. In [9] and [10] connectivity-preserving controllers are proposed, respectively, for undirected and leader-follower topologies based on barrier functions.…”
Section: Introductionmentioning
confidence: 99%
“…In [26,27], formation control approaches using potential-like functions were presented. In [28], a dipolar navigation function was introduced to design the formation controller. In [29], a formation tracking method was proposed to avoid obstacles while maintaining connectivity.…”
Section: Introductionmentioning
confidence: 99%