Click to open the HelpDesk interface
AECE - Front page banner

Menu:


FACTS & FIGURES

JCR Impact Factor: 0.459
JCR 5-Year IF: 0.442
Issues per year: 4
Current issue: Feb 2017
Next issue: May 2017
Avg review time: 78 days


PUBLISHER

Stefan cel Mare
University of Suceava
Faculty of Electrical Engineering and
Computer Science
13, Universitatii Street
Suceava - 720229
ROMANIA

Print ISSN: 1582-7445
Online ISSN: 1844-7600
WorldCat: 643243560
doi: 10.4316/AECE


TRAFFIC STATS

1,590,639 unique visits
489,780 downloads
Since November 1, 2009



Robots online now
Googlebot


SJR SCImago RANK

SCImago Journal & Country Rank


SEARCH ENGINES

aece.ro - Google Pagerank




TEXT LINKS

Anycast DNS Hosting
MOST RECENT ISSUES

 Volume 17 (2017)
 
     »   Issue 1 / 2017
 
 
 Volume 16 (2016)
 
     »   Issue 4 / 2016
 
     »   Issue 3 / 2016
 
     »   Issue 2 / 2016
 
     »   Issue 1 / 2016
 
 
 Volume 15 (2015)
 
     »   Issue 4 / 2015
 
     »   Issue 3 / 2015
 
     »   Issue 2 / 2015
 
     »   Issue 1 / 2015
 
 
 Volume 14 (2014)
 
     »   Issue 4 / 2014
 
     »   Issue 3 / 2014
 
     »   Issue 2 / 2014
 
     »   Issue 1 / 2014
 
 
  View all issues  


FEATURED ARTICLE

ABC Algorithm based Fuzzy Modeling of Optical Glucose Detection, SARACOGLU, O. G., BAGIS, A., KONAR, M., TABARU, T. E.
Issue 3/2016

AbstractPlus






LATEST NEWS

2017-Apr-04
We have the confirmation Advances in Electrical and Computer Engineering will be included in the EBSCO database.

2017-Feb-16
With new technologies, such as mobile communications, internet of things, and wide applications of social media, organizations generate a huge volume of data, much faster than several years ago. Big data, characterized by high volume, diversity and velocity, increasingly drives decision making and is changing the landscape of business intelligence, from governments to private organizations, from communities to individuals. Big data analytics that discover insights from evidences has a high demand for computing efficiency, knowledge discovery, problem solving, and event prediction. We dedicate a special section of Issue 4/2017 to Big Data. Prospective authors are asked to make the submissions for this section no later than the 31st of May 2017, placing "Big Data - " before the paper title in OpenConf.

2017-Jan-30
We have the confirmation Advances in Electrical and Computer Engineering will be included in the Gale database.

2016-Dec-17
IoT is a new emerging technology domain which will be used to connect all objects through the Internet for remote sensing and control. IoT uses a combination of WSN (Wireless Sensor Network), M2M (Machine to Machine), robotics, wireless networking, Internet technologies, and Smart Devices. We dedicate a special section of Issue 2/2017 to IoT. Prospective authors are asked to make the submissions for this section no later than the 31st of March 2017, placing "IoT - " before the paper title in OpenConf.

2016-Jun-14
Thomson Reuters published the Journal Citations Report for 2015. The JCR Impact Factor of Advances in Electrical and Computer Engineering is 0.459, and the JCR 5-Year Impact Factor is 0.442.

Read More »


    
 

  4/2010 - 11

Multi-Objective PSO- and NPSO-based Algorithms for Robot Path Planning

MASEHIAN, E. See more information about MASEHIAN, E. on SCOPUS See more information about MASEHIAN, E. on IEEExplore See more information about MASEHIAN, E. on Web of Science, SEDIGHIZADEH, D. See more information about SEDIGHIZADEH, D. on SCOPUS See more information about SEDIGHIZADEH, D. on SCOPUS See more information about SEDIGHIZADEH, D. on Web of Science
 
Click to see author's profile on See more information about the author on SCOPUS SCOPUS, See more information about the author on IEEE Xplore IEEE Xplore, See more information about the author on Web of Science Web of Science

Download PDF pdficon (12,322 KB) | Citation | Downloads: 1,336 | Views: 3,795

Author keywords
swarm robotic, infrared, AMiR, modulation methods

References keywords
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

Abstract
Quick view
Full text preview
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.


References | Cited By  «-- Click to see who has cited this paper

[1] H. Choset, K. Lynch, S. Hutchinson, G. Kantor, W. Burgard, L. Kavraki and S. Thrun, "Principle of Robot Motion: Theory, Algorithms, and Application," MIT Press, Cambridge, 2005, ISBN 0-262-03327-5.

[2] E. Masehian, and D. Sedighizadeh, "Classic and heuristic approaches in robot motion planning-a chronological review", Proc. of World Academy of Science, Engineering and Technology, Vol. 23, pp. 101-106, 2007.

[3] Q. Yuan-Qing, S. De-Bao, L. Ning and C. Yi-Gang, "Path planning for mobile robot using the particle swarm optimization with mutation operator", in Proc. Int. Conf. on Machine Learning and Cybernetics, pp. 2473 - 2478, 2004.

[4] W. Li, L. Yushu, D. Hongbin, and X. Yuanqing, "Obstacle-avoidance path planning for soccer robots using particle swarm optimization", in Proc. IEEE Int. Conf. on Rob. and Biomimetics (ROBIO) pp. 1233-1238, 2006.
[CrossRef] [SCOPUS Times Cited 29]


[5] C. Xin and L. Yangmin, "Smooth path planning of a mobile robot using stochastic particle swarm optimization" in Proc. IEEE on Mechatronics and Automation, pp. 1722-1727, 2006.
[CrossRef] [SCOPUS Times Cited 40]


[6] Yang, C. and Simon, D., "A new particle swarm optimization technique", in Proc. IEEE Int. Conf. on Systems Engineering, pp. 164- 169, 2005.
[CrossRef] [SCOPUS Times Cited 37]


[7] L. Kavraki, P. Svestka, J.C. Latombe, and M. Overmars, "Probabilistic roadmaps for path planning in high-dimensional configuration spaces", IEEE Trans. Robot. Autom. Vol 12, No. 4, pp. 566-580, 1996.
[CrossRef] [Web of Science Times Cited 1635] [SCOPUS Times Cited 2192]


[8] R. Hassan, B. Cohanim, and O. de Weck, "A comparison of particle swarm optimization and the genetic algorithm", American Institute of Aeronautics and Astronautics, 2004.

[9] J. Kennedy, and R.C. Eberhart, "Particle swarm optimization", in Proc. IEEE Int. Conf. on Neural Networks, pp. 1942-1948, 1995.
[CrossRef] [Web of Science Times Cited 16936] [SCOPUS Record]


[10] D. Sedighizadeh and E. Masehian, "A new taxonomy for particle swarm optimization (PSO)", in Proc. 10th International Conference on Automation Technology, National Cheng Kung University, Tainan, Taiwan, pp. 317-322, 2009.

[11] Y. Shi and R. Eberhart, "Particle swarm optimization with fuzzy adaptive inertia weight", in Proc. Workshop on Particle Swarm Optimization, Indianapolis, 2001.

[12] K., Fujimura, "Path planning with multiple objectives", J. of IEEE Robotics and Automation Society, vol.3. No.1, pp. 33-38, 1996.
[CrossRef] [Web of Science Times Cited 31] [SCOPUS Times Cited 31]


[13] H. Q. Min, J. H. Zhu, and X.J. Zheng, "Obstacle avoidance with multi-objective optimization by PSO in dynamic environment", in Proc. IEEE Int. Conf. Machine Learning and Cyber., Vol. 5, pp. 2950-2956, 2005.
[CrossRef]


[14] L. Gang, Y. Jianping, and X. Yangsheng, "Multi-objective optimal trajectory planning of space robot using particle swarm optimization", vol. 5264, Proc. of Int. symp. On Neural Networks, pp. 171-179, 2008.
[CrossRef] [SCOPUS Times Cited 4]


[15] D. O. Kang, S. H. Kim, H. Lee, and Z. Bien, "Multi objective navigation of a guide mobile robot for the visually impaired based on intention inference of obstacles", J. of Autonomous Robots, Vol. 10, No. 2, 2001.
[CrossRef] [Web of Science Times Cited 9] [SCOPUS Times Cited 11]




References Weight

Web of Science® Citations for all references: 18,611 TCR
SCOPUS® Citations for all references: 2,344 TCR

Web of Science® Average Citations per reference: 1,163 ACR
SCOPUS® Average Citations per reference: 147 ACR

TCR = Total Citations for References / ACR = Average Citations per Reference

We introduced in 2010 - for the first time in scientific publishing, the term "References Weight", as a quantitative indication of the quality ... Read more

Citations for references updated on 2017-04-25 09:28 in 67 seconds.




Note1: Web of Science® is a registered trademark of Thomson Reuters.
Note2: SCOPUS® is a registered trademark of Elsevier B.V.
Disclaimer: All queries to the respective databases were made by using the DOI record of every reference (where available). Due to technical problems beyond our control, the information is not always accurate. Please use the CrossRef link to visit the respective publisher site.

Copyright ©2001-2017
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.




Website loading speed and performance optimization powered by: