Motion planning for mobile robots: a method for the selection of a combination of motion-planning algorithms

J.J.M. Lunenburg, S.A.M. Coenen, G.J.L. Naus, M.J.G. van de Molengraft, M. Steinbuch

Research output: Contribution to journalArticleAcademicpeer-review

5 Citations (Scopus)
2 Downloads (Pure)

Abstract

A motion planner for mobile robots is commonly built out of a number of algorithms that solve the two steps of motion planning: 1) representing the robot and its environment and 2) searching a path through the represented environment. However, the available literature on motion planning lacks a generic methodology to arrive at a combination of representations and search algorithm classes for a practical application. This article presents a method to select appropriate algorithm classes that solve both the steps of motion planning and to select a suitable approach to combine those algorithm classes. The method is verified by comparing its outcome with three different motion planners that have been successfully applied on robots in practice.

Original languageEnglish
Article number7493595
Pages (from-to)107-117
Number of pages11
JournalIEEE Robotics and Automation Magazine
Volume23
Issue number4
DOIs
Publication statusPublished - 1 Dec 2016

Fingerprint

Motion planning
Mobile robots
Robots

Cite this

@article{084407e1124f4734b31ea26061b97bc1,
title = "Motion planning for mobile robots: a method for the selection of a combination of motion-planning algorithms",
abstract = "A motion planner for mobile robots is commonly built out of a number of algorithms that solve the two steps of motion planning: 1) representing the robot and its environment and 2) searching a path through the represented environment. However, the available literature on motion planning lacks a generic methodology to arrive at a combination of representations and search algorithm classes for a practical application. This article presents a method to select appropriate algorithm classes that solve both the steps of motion planning and to select a suitable approach to combine those algorithm classes. The method is verified by comparing its outcome with three different motion planners that have been successfully applied on robots in practice.",
author = "J.J.M. Lunenburg and S.A.M. Coenen and G.J.L. Naus and {van de Molengraft}, M.J.G. and M. Steinbuch",
year = "2016",
month = "12",
day = "1",
doi = "10.1109/MRA.2015.2510798",
language = "English",
volume = "23",
pages = "107--117",
journal = "IEEE Robotics and Automation Magazine",
issn = "1070-9932",
publisher = "Institute of Electrical and Electronics Engineers",
number = "4",

}

Motion planning for mobile robots : a method for the selection of a combination of motion-planning algorithms. / Lunenburg, J.J.M.; Coenen, S.A.M.; Naus, G.J.L.; van de Molengraft, M.J.G.; Steinbuch, M.

In: IEEE Robotics and Automation Magazine, Vol. 23, No. 4, 7493595, 01.12.2016, p. 107-117.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Motion planning for mobile robots

T2 - a method for the selection of a combination of motion-planning algorithms

AU - Lunenburg, J.J.M.

AU - Coenen, S.A.M.

AU - Naus, G.J.L.

AU - van de Molengraft, M.J.G.

AU - Steinbuch, M.

PY - 2016/12/1

Y1 - 2016/12/1

N2 - A motion planner for mobile robots is commonly built out of a number of algorithms that solve the two steps of motion planning: 1) representing the robot and its environment and 2) searching a path through the represented environment. However, the available literature on motion planning lacks a generic methodology to arrive at a combination of representations and search algorithm classes for a practical application. This article presents a method to select appropriate algorithm classes that solve both the steps of motion planning and to select a suitable approach to combine those algorithm classes. The method is verified by comparing its outcome with three different motion planners that have been successfully applied on robots in practice.

AB - A motion planner for mobile robots is commonly built out of a number of algorithms that solve the two steps of motion planning: 1) representing the robot and its environment and 2) searching a path through the represented environment. However, the available literature on motion planning lacks a generic methodology to arrive at a combination of representations and search algorithm classes for a practical application. This article presents a method to select appropriate algorithm classes that solve both the steps of motion planning and to select a suitable approach to combine those algorithm classes. The method is verified by comparing its outcome with three different motion planners that have been successfully applied on robots in practice.

UR - http://www.scopus.com/inward/record.url?scp=84975292137&partnerID=8YFLogxK

U2 - 10.1109/MRA.2015.2510798

DO - 10.1109/MRA.2015.2510798

M3 - Article

AN - SCOPUS:84975292137

VL - 23

SP - 107

EP - 117

JO - IEEE Robotics and Automation Magazine

JF - IEEE Robotics and Automation Magazine

SN - 1070-9932

IS - 4

M1 - 7493595

ER -