Multiple mobile robot path planning for rollover prevention and collision avoidance

Jae Byung Park

Multiple mobile robot path planning for rollover prevention and collision avoidance

Jae Byung Park^*

^*Corresponding author for this work

Division of Electronic Engineering

Research output: Contribution to conference › Conference paper › peer-review

2 Scopus citations

Abstract

A multiple mobile robot path planning method is proposed for both rollover prevention and collision avoidance. The proposed method consists of two steps such as rollover-free path generation and collision avoidance among multiple mobile robots. In the first step, the smooth path without rollover is generated by using the sequential Hermite curves, taking intrinsic constraints of the mobile robots into consideration. In the next step, the departure time of every mobile robot is determined for collision avoidance among mobile robots using the extended collision map. Finally, the simulation is carried out with multiple mobile robots for verifying the efficiency of the proposed method.

Original language	English
Title of host publication	ICCAS 2011 - 2011 11th International Conference on Control, Automation and Systems
Pages	1732-1734
Number of pages	3
State	Published - 2011
Event	2011 11th International Conference on Control, Automation and Systems, ICCAS 2011 - Gyeonggi-do, Korea, Republic of Duration: 2011.10.26 → 2011.10.29

Publication series

Name	International Conference on Control, Automation and Systems
ISSN (Print)	1598-7833

Conference

Conference	2011 11th International Conference on Control, Automation and Systems, ICCAS 2011
Country/Territory	Korea, Republic of
City	Gyeonggi-do
Period	11.10.26 → 11.10.29

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 3 Good Health and Well-being

Keywords

Collision avoidance
Multiple mobile robots
Rollover prevention

Quacquarelli Symonds(QS) Subject Topics

Computer Science & Information Systems
Engineering - Electrical & Electronic
Engineering - Petroleum
Data Science

Cite this

@inproceedings{4b86d95aa6cc4a5686f4c3a221a74b17,

title = "Multiple mobile robot path planning for rollover prevention and collision avoidance",

abstract = "A multiple mobile robot path planning method is proposed for both rollover prevention and collision avoidance. The proposed method consists of two steps such as rollover-free path generation and collision avoidance among multiple mobile robots. In the first step, the smooth path without rollover is generated by using the sequential Hermite curves, taking intrinsic constraints of the mobile robots into consideration. In the next step, the departure time of every mobile robot is determined for collision avoidance among mobile robots using the extended collision map. Finally, the simulation is carried out with multiple mobile robots for verifying the efficiency of the proposed method.",

keywords = "Collision avoidance, Multiple mobile robots, Rollover prevention",

author = "Park, \{Jae Byung\}",

year = "2011",

language = "English",

isbn = "9781457708350",

series = "International Conference on Control, Automation and Systems",

pages = "1732--1734",

booktitle = "ICCAS 2011 - 2011 11th International Conference on Control, Automation and Systems",

note = "2011 11th International Conference on Control, Automation and Systems, ICCAS 2011 ; Conference date: 26-10-2011 Through 29-10-2011",

}

Park, JB 2011, Multiple mobile robot path planning for rollover prevention and collision avoidance. in ICCAS 2011 - 2011 11th International Conference on Control, Automation and Systems., 6106213, International Conference on Control, Automation and Systems, pp. 1732-1734, 2011 11th International Conference on Control, Automation and Systems, ICCAS 2011, Gyeonggi-do, Korea, Republic of, 11.10.26.

TY - GEN

T1 - Multiple mobile robot path planning for rollover prevention and collision avoidance

AU - Park, Jae Byung

PY - 2011

Y1 - 2011

N2 - A multiple mobile robot path planning method is proposed for both rollover prevention and collision avoidance. The proposed method consists of two steps such as rollover-free path generation and collision avoidance among multiple mobile robots. In the first step, the smooth path without rollover is generated by using the sequential Hermite curves, taking intrinsic constraints of the mobile robots into consideration. In the next step, the departure time of every mobile robot is determined for collision avoidance among mobile robots using the extended collision map. Finally, the simulation is carried out with multiple mobile robots for verifying the efficiency of the proposed method.

AB - A multiple mobile robot path planning method is proposed for both rollover prevention and collision avoidance. The proposed method consists of two steps such as rollover-free path generation and collision avoidance among multiple mobile robots. In the first step, the smooth path without rollover is generated by using the sequential Hermite curves, taking intrinsic constraints of the mobile robots into consideration. In the next step, the departure time of every mobile robot is determined for collision avoidance among mobile robots using the extended collision map. Finally, the simulation is carried out with multiple mobile robots for verifying the efficiency of the proposed method.

KW - Collision avoidance

KW - Multiple mobile robots

KW - Rollover prevention

UR - https://www.scopus.com/pages/publications/84863027776

M3 - Conference paper

AN - SCOPUS:84863027776

SN - 9781457708350

T3 - International Conference on Control, Automation and Systems

SP - 1732

EP - 1734

BT - ICCAS 2011 - 2011 11th International Conference on Control, Automation and Systems

T2 - 2011 11th International Conference on Control, Automation and Systems, ICCAS 2011

Y2 - 26 October 2011 through 29 October 2011

ER -

Multiple mobile robot path planning for rollover prevention and collision avoidance

Abstract

Publication series

Conference

UN SDGs

Keywords

Quacquarelli Symonds(QS) Subject Topics

Other files and links

Fingerprint

Cite this