Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Sung-Gil Wee

dblp:137/9775 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Motion planning and robot control · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › multi-robot control
decentralized cooperative control
0.212015
Decentralized cooperative mean approach to collision avoidance for nonholonomic mobile robots · ICRA 2015
Robotics › Motion planning and robot control › collision avoidance
multi-robot collision avoidance
0.212015
Decentralized cooperative mean approach to collision avoidance for nonholonomic mobile robots · ICRA 2015
Robotics › Motion planning and robot control › mobile robot control
nonholonomic mobile robot
0.112015
Decentralized cooperative mean approach to collision avoidance for nonholonomic mobile robots · ICRA 2015

Methods — techniques the papers use, named apart from their topics

monte carlo simulation · 0.2high-gain robust control · 0.2
YearPublicationVenuePosition
2015 Decentralized cooperative mean approach to collision avoidance for nonholonomic mobile robots
abstract
This paper presents a novel, decentralized, control-theoretic approach to address collision avoidance for multi-robot systems. We create a virtual obstacle at the mean position of the robots. A control is be designed such that each robot will avoid the closest obstacle when a collision is possible. The closest obstacle can be the virtual obstacle or the nearest robot. We present two such control laws. The first assumes perfect knowledge of the velocities of all nearby robots and can allow a saturated velocity input for each robot. In practice, the velocities of the other robots are hard to measure or estimate precisely. Therefore, the second control law removes the assumption of known velocities based on a high-gain, robust control scheme. We prove the first control scheme is globally asymptotically stable, and the robust control law is globally uniformly ultimately bounded. To verify the effectiveness of the proposed approach, Monte Carlo simulations and experiments have been conducted.
Jingfu Jin, Yoon-Gu Kim, Sung-Gil Wee, Nicholas R. Gans
ICRA3