Ant Colony Optimization algorithm for robot path planning

Path planning is an essential task for the navigation and motion control of autonomous robot manipulators. This NP-complete problem is difficult to solve, especially in a dynamic environment where the optimal path needs to be rerouted in real-time when a new obstacle appears. The ACO (Ant Colony Opt...

Full description

Saved in:
Bibliographic Details
Published in:2010 International Conference On Computer Design and Applications Vol. 3; pp. V3-436 - V3-440
Main Authors: Brand, M, Masuda, M, Wehner, N, Xiao-Hua Yu
Format: Conference Proceeding
Language:English
Japanese
Published: IEEE 01.06.2010
Subjects:
Ant colony optimization
Application software
Computer simulation
Manipulator dynamics
Motion control
Navigation
NP-complete problem
Particle swarm optimization
Path planning
Robot Path Planning
Robots
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Path planning is an essential task for the navigation and motion control of autonomous robot manipulators. This NP-complete problem is difficult to solve, especially in a dynamic environment where the optimal path needs to be rerouted in real-time when a new obstacle appears. The ACO (Ant Colony Optimization) algorithm is an optimization technique based on swarm intelligence. This paper investigates the application of ACO to robot path planning in a dynamic environment. Two different pheromone re-initialization schemes are compared and computer simulation results are presented.
AbstractList Path planning is an essential task for the navigation and motion control of autonomous robot manipulators. This NP-complete problem is difficult to solve, especially in a dynamic environment where the optimal path needs to be rerouted in real-time when a new obstacle appears. The ACO (Ant Colony Optimization) algorithm is an optimization technique based on swarm intelligence. This paper investigates the application of ACO to robot path planning in a dynamic environment. Two different pheromone re-initialization schemes are compared and computer simulation results are presented.
Author Wehner, N
Brand, M
Xiao-Hua Yu
Masuda, M
Author_xml – sequence: 1
  givenname: M
  surname: Brand
  fullname: Brand, M
  organization: Dept. of Electr. Eng., California Polytech. State Univ., San Luis Obispo, CA, USA
– sequence: 2
  givenname: M
  surname: Masuda
  fullname: Masuda, M
  organization: Dept. of Electr. Eng., California Polytech. State Univ., San Luis Obispo, CA, USA
– sequence: 3
  givenname: N
  surname: Wehner
  fullname: Wehner, N
  organization: Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN, USA
– sequence: 4
  surname: Xiao-Hua Yu
  fullname: Xiao-Hua Yu
  organization: Dept. of Electr. Eng., California Polytech. State Univ., San Luis Obispo, CA, USA
BookMark eNotj8tKAzEYRiPYhda-gG7yAlNzj1kO8dJCoRu7Ln8mSRuYSYaYTX16C3b1cTaH8z2i-1xyQOiZkjWlxLxurX3v14xcWUpBOSF3aGX0GxVMCE2VkA_I9LlhW8aSL3g_tzSlX2ipZAzjqdTUzhOOpeJaXGl4hnbG8wg5p3x6QosI409Y3XaJDp8f33bT7fZfW9vvukSlap1XnCk3SEMiB-G0YtExI7wSXtJrhWFAiSPO8aAHH2SM2gzaAImec9CeL9HLvzeFEI5zTRPUy_F2iP8B8dVEqQ
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICCDA.2010.5541300
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library (IEL) (UW System Shared)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEL
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 9781424471645
1424471648
EndPage V3-440
ExternalDocumentID 5541300
Genre orig-research
GroupedDBID 6IE
6IL
CBEJK
RIE
RIL
ID FETCH-LOGICAL-i156t-d6326bc590f3a4b762fb294d64d5147192a10b0bb3e7cde5ff79c79a0fd33a7d3
IEDL.DBID RIE
IngestDate Thu Jun 29 18:39:22 EDT 2023
IsPeerReviewed false
IsScholarly false
Language English
Japanese
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i156t-d6326bc590f3a4b762fb294d64d5147192a10b0bb3e7cde5ff79c79a0fd33a7d3
ParticipantIDs ieee_primary_5541300
PublicationCentury 2000
PublicationDate 2010-06
PublicationDateYYYYMMDD 2010-06-01
PublicationDate_xml – month: 06
  year: 2010
  text: 2010-06
PublicationDecade 2010
PublicationTitle 2010 International Conference On Computer Design and Applications
PublicationTitleAbbrev ICCDA
PublicationYear 2010
Publisher IEEE
Publisher_xml – name: IEEE
Score 1.8286352
Snippet Path planning is an essential task for the navigation and motion control of autonomous robot manipulators. This NP-complete problem is difficult to solve,...
SourceID ieee
SourceType Publisher
StartPage V3-436
SubjectTerms Ant colony optimization
Application software
Computer simulation
Manipulator dynamics
Motion control
Navigation
NP-complete problem
Particle swarm optimization
Path planning
Robot Path Planning
Robots
Title Ant Colony Optimization algorithm for robot path planning
URI https://ieeexplore.ieee.org/document/5541300
Volume 3
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NSwMxEB3a4sGTSit-k4NH16b7lc2xVIuC1B4UeitJJtGC3S3t1t_vZHetCF68hRAIQ0jmvZl5GYDr0KCOEu0CkTobxInTgbQ-Bi8UckQMMauEwk9iMslmMzltwc1OC2OtrYrP7K0fVrl8LMzWh8r65Pp89qUNbSHSWqv1rYPhsv84Gt0N62KtZuGvjimVwxgf_G-rQ-j9KO_YdOdTjqBl8y7IYV4yYvhE1NkzXfFlo51k6uOtIHL_vmQEPdm60EXJfIthtmpaEfXgdXz_MnoImpYHwYKIVBlgSnBKm0RyF6lY00vldChjTGMkZCMIjqkB11zryAqDNnFOSCOk4g6jSAmMjqGTF7k9AWb933FEM3XmSUeYKa2IjWRouAr1IJOn0PVmz1f1rxbzxuKzv6fPYb_Om_v4wwV0yvXWXsKe-SwXm_VVdRRfSQOMyg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0gmuhJDRi_7cGjK2U_6PZIUAIRkQMm3EjbaZUEdsm6-Pttd1eMiRdvTdOkmTTtvDczrwNw6yuUQSSNxzpGe2FkpMe1i8EzgRQRfYwLofCIjcfxbMYnNbjbamG01kXxmb53wyKXj6nauFBZy7o-l33Zgd0oDH1aqrW-lTCUt4a93kO3LNeqlv7qmVK4jP7h_zY7guaP9o5Mtl7lGGo6aQDvJjmxHN9SdfJiL_mqUk8SsXxLLb1_XxELPkmWyjQnrskwWVfNiJrw2n-c9gZe1fTAW1gqlXvYsYBKqohTE4hQ2rfKSJ-H2AnRYhtmAZloU0mlDDRTqCNjGFeMC2owCATD4ATqSZroUyDa_R5niaaMHe3wYyGF5SMxKip82Y75GTSc2fN1-a_FvLL4_O_pG9gfTJ9H89Fw_HQBB2UW3UUjLqGeZxt9BXvqM198ZNfFsXwBzpWQEQ
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2010+International+Conference+On+Computer+Design+and+Applications&rft.atitle=Ant+Colony+Optimization+algorithm+for+robot+path+planning&rft.au=Brand%2C+M&rft.au=Masuda%2C+M&rft.au=Wehner%2C+N&rft.au=Xiao-Hua+Yu&rft.date=2010-06-01&rft.pub=IEEE&rft.volume=3&rft.spage=V3-436&rft.epage=V3-440&rft_id=info:doi/10.1109%2FICCDA.2010.5541300&rft.externalDocID=5541300