|4/2010 - 11|
Multi-Objective PSO- and NPSO-based Algorithms for Robot Path PlanningMASEHIAN, E. , SEDIGHIZADEH, D.
|Click to see author's profile on SCOPUS, IEEE Xplore, Web of Science|
|Download PDF (12,316 KB) | Citation | Downloads: 1,311 | Views: 3,630|
swarm robotic, infrared, AMiR, modulation methods
optimization(11), swarm(10), robot(7), planning(7), path(5)
Blue keywords are present in both the references section and the paper title.
About this article
Date of Publication: 2010-11-30
Volume 10, Issue 4, Year 2010, On page(s): 69 - 76
ISSN: 1582-7445, e-ISSN: 1844-7600
Digital Object Identifier: 10.4316/AECE.2010.04011
Web of Science Accession Number: 000284782700011
SCOPUS ID: 78649718263
In this paper two novel Particle Swarm Optimization (PSO)-based algorithms are presented for robot path planning with respect to two objectives, the shortest and smoothest path criteria. The first algorithm is a hybrid of the PSO and the Probabilistic Roadmap (PRM) methods, in which the PSO serves as the global planner whereas the PRM performs the local planning task. The second algorithm is a combination of the New or Negative PSO (NPSO) and the PRM methods. Contrary to the basic PSO in which the best position of all particles up to the current iteration is used as a guide, the NPSO determines the most promising direction based on the negative of the worst particle position. The two objective functions are incorporated in the PSO equations, and the PSO and PRM are combined by adding good PSO particles as auxiliary nodes to the random nodes generated by the PRM. Both the PSO+PRM and NPSO+PRM algorithms are compared with the pure PRM method in path length and runtime. The results showed that the NPSO has a slight advantage over the PSO, and the generated paths are shorter and smoother than those of the PRM and are calculated in less time.
Web of Science® Times Cited: 20 [View]
View record in Web of Science® [View]
View Related Records® [View]
SCOPUS® Times Cited: 24
View record in SCOPUS® [Free preview]
 Improvement of the Gravitational Search Algorithm by means of Low-Discrepancy Sobol Quasi Random-Number Sequence Based Initialization, ALTINOZ, O. T., YILMAZ, A. E., WEBER, G.-W., Advances in Electrical and Computer Engineering, ISSN 1582-7445, Issue 3, Volume 14, 2014.
Digital Object Identifier: 10.4316/AECE.2014.03007 [CrossRef] [Full text]
 Comparing the Robustness of Evolutionary Algorithms on the Basis of Benchmark Functions, DENIZ ULKER, E., HAYDAR, A., Advances in Electrical and Computer Engineering, ISSN 1582-7445, Issue 2, Volume 13, 2013.
Digital Object Identifier: 10.4316/AECE.2013.02010 [CrossRef] [Full text]
 Applying the MOVNS (multi-objective variable neighborhood search) algorithm to solve the path planning problem in mobile robotics, Hidalgo-Paniagua, Alejandro, Vega-Rodríguez, Miguel A., Ferruz, Joaquín, Expert Systems with Applications, ISSN 0957-4174, Issue , 2016.
Digital Object Identifier: 10.1016/j.eswa.2016.03.035 [CrossRef]
 Heuristic approaches in robot path planning: A survey, Mac, Thi Thoa, Copot, Cosmin, Tran, Duc Trung, De Keyser, Robin, Robotics and Autonomous Systems, ISSN 0921-8890, Issue , 2016.
Digital Object Identifier: 10.1016/j.robot.2016.08.001 [CrossRef]
 A hybridization of an improved particle swarm optimization and gravitational search algorithm for multi-robot path planning, Das, P.K., Behera, H.S., Panigrahi, B.K., Swarm and Evolutionary Computation, ISSN 2210-6502, Issue , 2016.
Digital Object Identifier: 10.1016/j.swevo.2015.10.011 [CrossRef]
 Intelligent adaptive immune-based motion planner of a mobile robot in cluttered environment, Deepak, B. B. V. L., Parhi, Dayal, Intelligent Service Robotics, ISSN 1861-2776, Issue 3, Volume 6, 2013.
Digital Object Identifier: 10.1007/s11370-013-0131-9 [CrossRef]
 Control of the Bed Temperature of a Circulating Fluidized Bed Boiler by using Particle Swarm Optimization, AYGUN, H., DEMIREL, H., CERNAT, M., Advances in Electrical and Computer Engineering, ISSN 1582-7445, Issue 2, Volume 12, 2012.
Digital Object Identifier: 10.4316/aece.2012.02005 [CrossRef] [Full text]
 Innate Immune based Path Planner of an Autonomous Mobile Robot, Deepak, B.B.V.L., Parhi, Dayal R., Kundu, Shubhasri, Procedia Engineering, ISSN 1877-7058, Issue , 2012.
Digital Object Identifier: 10.1016/j.proeng.2012.06.313 [CrossRef]
 A Motion Planning System for Mobile Robots, TUNCER, A., YILDIRIM, M., ERKAN, K., Advances in Electrical and Computer Engineering, ISSN 1582-7445, Issue 1, Volume 12, 2012.
Digital Object Identifier: 10.4316/aece.2012.01010 [CrossRef] [Full text]
 Multi-robot path planning in a dynamic environment using improved gravitational search algorithm, Das, P.K., Behera, H.S., Jena, P.K., Panigrahi, B.K., Journal of Electrical Systems and Information Technology, ISSN 2314-7172, Issue 2, Volume 3, 2016.
Digital Object Identifier: 10.1016/j.jesit.2015.12.003 [CrossRef]
 Intelligent-based multi-robot path planning inspired by improved classical Q-learning and improved particle swarm optimization with perturbed velocity, Das, P.K., Behera, H.S., Panigrahi, B.K., Engineering Science and Technology, an International Journal, ISSN 2215-0986, Issue 1, Volume 19, 2016.
Digital Object Identifier: 10.1016/j.jestch.2015.09.009 [CrossRef]
 Advance Particle Swarm Optimization-Based Navigational Controller For Mobile Robot, Deepak, B. B. V. L., Parhi, Dayal R., Raju, B. M. V. A., Arabian Journal for Science and Engineering, ISSN 1319-8025, Issue 8, Volume 39, 2014.
Digital Object Identifier: 10.1007/s13369-014-1154-z [CrossRef]
 A hybrid improved PSO-DV algorithm for multi-robot path planning in a clutter environment, Das, P.K., Behera, H.S., Das, Swagatam, Tripathy, H.K., Panigrahi, B.K., Pradhan, S.K., Neurocomputing, ISSN 0925-2312, Issue , 2016.
Digital Object Identifier: 10.1016/j.neucom.2016.05.057 [CrossRef]
 Solving the multi-objective path planning problem in mobile robotics with a firefly-based approach, Hidalgo-Paniagua, Alejandro, Vega-Rodríguez, Miguel A., Ferruz, Joaquín, Pavón, Nieves, Soft Computing, ISSN 1432-7643, 2015.
Digital Object Identifier: 10.1007/s00500-015-1825-z [CrossRef]
 MOSFLA-MRPP: Multi-Objective Shuffled Frog-Leaping Algorithm applied to Mobile Robot Path Planning, Hidalgo-Paniagua, Alejandro, Vega-Rodríguez, Miguel A., Ferruz, Joaquín, Pavón, Nieves, Engineering Applications of Artificial Intelligence, ISSN 0952-1976, Issue , 2015.
Digital Object Identifier: 10.1016/j.engappai.2015.05.011 [CrossRef]
 Swarm/flock optimization algorithms as continuous dynamic systems, Laudani, Antonino, Riganti Fulginei, Francesco, Lozito, Gabriele Maria, Salvini, Alessandro, Applied Mathematics and Computation, ISSN 0096-3003, Issue , 2014.
Digital Object Identifier: 10.1016/j.amc.2014.06.046 [CrossRef]
 Modified Genetic Algorithm based on A* Algorithm of Multi Objective Optimization for Path Planning, Oleiwi, Bashra K., Roth, Hubert, Kazem, Bahaa I., Journal of Automation and Control Engineering, ISSN 2301-3702, Issue 4, Volume 2, 2014.
Digital Object Identifier: 10.12720/joace.2.4.357-362 [CrossRef]
 PSO based path planner of an autonomous mobile robot, Deepak, B., Parhi, Dayal, Open Computer Science, ISSN 2299-1093, Issue 2, Volume 2, 2012.
Digital Object Identifier: 10.2478/s13537-012-0009-5 [CrossRef]
 Adaptive Charged System Search Approach to Path Planning for Multiple Mobile Robots, Precup, Radu-Emil, Petriu, Emil M., Radae, Mircea-Bogdan, Voisan, Emil-Ioan, Dragan, Florin, IFAC-PapersOnLine, ISSN 2405-8963, Issue 10, Volume 48, 2015.
Digital Object Identifier: 10.1016/j.ifacol.2015.08.147 [CrossRef]
 PSO-Based Robot Path Planning for Multisurvivor Rescue in Limited Survival Time, Geng, N., Gong, D. W., Zhang, Y., Mathematical Problems in Engineering, ISSN 1024-123X, Issue , 2014.
Digital Object Identifier: 10.1155/2014/187370 [CrossRef]
 An intelligent multi-robot path planning in a dynamic environment using improved gravitational search algorithm, Das, P. K., Behera, H. S., Jena, P. K., Panigrahi, B. K., International Journal of Automation and Computing, ISSN 1476-8186, 2016.
Digital Object Identifier: 10.1007/s11633-016-1019-x [CrossRef]
Disclaimer: All information displayed above was retrieved by using remote connections to respective databases. For the best user experience, we update all data by using background processes, and use caches in order to reduce the load on the servers we retrieve the information from. As we have no control on the availability of the database servers and sometimes the Internet connectivity may be affected, we do not guarantee the information is correct or complete. For the most accurate data, please always consult the database sites directly. Some external links require authentication or an institutional subscription.
Web of Science® is a registered trademark of Thomson Reuters, Scopus® is a registered trademark of Elsevier B.V., other product names, company names, brand names, trademarks and logos are the property of their respective owners.
Faculty of Electrical Engineering and Computer Science
Stefan cel Mare University of Suceava, Romania
All rights reserved: Advances in Electrical and Computer Engineering is a registered trademark of the Stefan cel Mare University of Suceava. No part of this publication may be reproduced, stored in a retrieval system, photocopied, recorded or archived, without the written permission from the Editor. When authors submit their papers for publication, they agree that the copyright for their article be transferred to the Faculty of Electrical Engineering and Computer Science, Stefan cel Mare University of Suceava, Romania, if and only if the articles are accepted for publication. The copyright covers the exclusive rights to reproduce and distribute the article, including reprints and translations.
Permission for other use: The copyright owner's consent does not extend to copying for general distribution, for promotion, for creating new works, or for resale. Specific written permission must be obtained from the Editor for such copying. Direct linking to files hosted on this website is strictly prohibited.
Disclaimer: Whilst every effort is made by the publishers and editorial board to see that no inaccurate or misleading data, opinions or statements appear in this journal, they wish to make it clear that all information and opinions formulated in the articles, as well as linguistic accuracy, are the sole responsibility of the author.