Heuristic D algorithm based on particle swarm optimization for path planning of two-link robot arm in dynamic environment
Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with movin...
Saved in:
| Published in | Ai-Khawarizmi engineering journal Vol. 15; no. 2; pp. 108 - 123 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Baghdad, Iraq
University of Baghdad, al-Khwarizmi College of Engineering
28.05.2019
Al-Khwarizmi College of Engineering – University of Baghdad |
| Online Access | Get full text |
| ISSN | 1818-1171 2312-0789 2312-0789 |
| DOI | 10.22153/kej.2019.01.004 |
Cover
| Abstract | Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved. In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO) technique. Moreover, this work focuses on computational part of motion planning in completely changing dynamic environment at every motion sample domains. Since the environment type that discussed here is a known dynamic environment, the solution approach can be off-line. The main advantage of the off-line planning is that a global optimal path solution is always obtained, which is able to overcome all the difficulties caused by the dynamic behavior of the obstacles. A mixing approach of robot path planning using the heuristic method D* algorithm based on optimization technique is used. The heuristic D* method is chosen for finding the shortest path. Furthermore, to insure the path length optimality and for enhancing the final path, PSO technique has been utilized. The robot type has been used here is the two-link robot arm which represents a more difficult case than the mobile robot. Simulation results are given to show the effectiveness of the proposed method which clearly shows a completely safe and short path. |
|---|---|
| AbstractList | Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved. In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO) technique. Moreover, this work focuses on computational part of motion planning in completely changing dynamic environment at every motion sample domains. Since the environment type that discussed here is a known dynamic environment, the solution approach can be off-line. The main advantage of the off-line planning is that a global optimal path solution is always obtained, which is able to overcome all the difficulties caused by the dynamic behavior of the obstacles. A mixing approach of robot path planning using the heuristic method D* algorithm based on optimization technique is used. The heuristic D* method is chosen for finding the shortest path. Furthermore, to insure the path length optimality and for enhancing the final path, PSO technique has been utilized. The robot type has been used here is the two-link robot arm which represents a more difficult case than the mobile robot. Simulation results are given to show the effectiveness of the proposed method which clearly shows a completely safe and short path. Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved. In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO) technique. Moreover, this work focuses on computational part of motion planning in completely changing dynamic environment at every motion sample domains. Since the environment type that discussed here is a known dynamic environment, the solution approach can be off-line. The main advantage of the off-line planning is that a global optimal path solution is always obtained, which is able to overcome all the difficulties caused by the dynamic behavior of the obstacles. A mixing approach of robot path planning using the heuristic method D* algorithm based on optimization technique is used. The heuristic D* method is chosen for finding the shortest path. Furthermore, to insure the path length optimality and for enhancing the final path, PSO technique has been utilized. The robot type has been used here is the two-link robot arm which represents a more difficult case than the mobile robot. Simulation results are given to show the effectiveness of the proposed method which clearly shows a completely safe and short path. Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots and manipulators since nowadays the world is looking forward to this challenge. The collision free path for robot in an environment with moving obstacles such as different objects, humans, animals or other robots is considered as an actual problem that needs to be solved. In addition, the local minima and sharp edges are the most common problems in all path planning algorithms. The main objective of this work is to overcome these problems by demonstrating the robot path planning and obstacle avoidance using D star (D*) algorithm based on Particle Swarm Optimization (PSO) technique. Moreover, this work focuses on computational part of motion planning in completely changing dynamic environment at every motion sample domains. Since the environment type that discussed here is a known dynamic environment, the solution approach can be off-line. The main advantage of the off-line planning is that a global optimal path solution is always obtained, which is able to overcome all the difficulties caused by the dynamic behavior of the obstacles. A mixing approach of robot path planning using the heuristic method D* algorithm based on optimization technique is used. The heuristic D* method is chosen for finding the shortest path. Furthermore, to insure the path length optimality and for enhancing the final path, PSO technique has been utilized. The robot type has been used here is the two-link robot arm which represents a more difficult case than the mobile robot. Simulation results are given to show the effectiveness of the proposed method which clearly shows a completely safe and short path. |
| Author | Rahim, Firas Abd al-Razzaq Hamid, Umniyah Ibrahim |
| Author_xml | – sequence: 1 fullname: Rahim, Firas Abd al-Razzaq – sequence: 2 fullname: Hamid, Umniyah Ibrahim |
| BookMark | eNqNkc1r3DAQxUVJods0956K_gFvNfqw7GNJPxII9JKexUiWNkpsychKl-1fX2c3tNBDyWlgHr_3mHlvyVnKyRPyHtiWc1Di44O_33IG_ZbBljH5imy4AN4w3fVnZAMddA2AhjfkYlmiZQqk4kL2G3K48o8lLjU6-pniuMsl1ruJWlz8QHOiM5ZVGz1d9lgmmucap_gLa1y1kMuq1zs6j5hSTDuaA6373IwxPdCSba70CYqJDoeE05rh089Ycpp8qu_I64Dj4i-e5zn58fXL7eVVc_P92_Xlp5vGcehlo5XmwiIG7_UgUAVnWy1l3ztskYs-dM5LPnitUEkhgwVoB2mVBtl2mllxTq5PvkPGezOXOGE5mIzRHBe57MzzjaYHrZxX4LSSkjFnpbatkkpqDErLdvWCk9djmvGwx3H8YwjMHKswaxXmqQrDwKxVrAw7Ma7kZSk-vARp_0FcrMef14Jx_B_44QT6NcAH_BvFJeeCi9833qsS |
| CitedBy_id | crossref_primary_10_3934_mbe_2021001 crossref_primary_10_1155_2023_5098156 crossref_primary_10_31590_ejosat_883266 crossref_primary_10_1080_17538947_2023_2197261 crossref_primary_10_3390_a17050197 crossref_primary_10_3233_JIFS_231280 |
| ContentType | Journal Article |
| DBID | ADJCN AHFXO AAYXX CITATION ADTOC UNPAY DOA |
| DOI | 10.22153/kej.2019.01.004 |
| DatabaseName | الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete CrossRef Unpaywall for CDI: Periodical Content Unpaywall DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | CrossRef |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: UNPAY name: Unpaywall url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/ sourceTypes: Open Access Repository |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| DocumentTitleAlternate | تخطيط مسار لذراع روبوت باستخدام خوارزمية D* بالاعتماد على تقنية سرب الطيور |
| EISSN | 2312-0789 |
| EndPage | 123 |
| ExternalDocumentID | oai_doaj_org_article_9175ce51c754400cb47b654547af5746 10.22153/kej.2019.01.004 10_22153_kej_2019_01_004 1242232 |
| GroupedDBID | 5VS ADBBV ADJCN AFWDF AHFXO ALMA_UNASSIGNED_HOLDINGS ARCSS BCNDV GROUPED_DOAJ KQ8 AAYXX CITATION ADTOC UNPAY |
| ID | FETCH-LOGICAL-c2194-75723baafee7d3a5fcb674499ca6a239f8ce42de75a5434fb116d4b57146870b3 |
| IEDL.DBID | UNPAY |
| ISSN | 1818-1171 2312-0789 |
| IngestDate | Fri Oct 03 12:52:53 EDT 2025 Tue Aug 19 23:17:25 EDT 2025 Thu Apr 24 23:10:22 EDT 2025 Tue Jul 01 02:37:19 EDT 2025 Thu Sep 25 15:16:02 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| License | cc-by |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c2194-75723baafee7d3a5fcb674499ca6a239f8ce42de75a5434fb116d4b57146870b3 |
| OpenAccessLink | https://proxy.k.utb.cz/login?url=https://alkej.uobaghdad.edu.iq/index.php/alkej/article/download/551/514 |
| PageCount | 16 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_9175ce51c754400cb47b654547af5746 unpaywall_primary_10_22153_kej_2019_01_004 crossref_primary_10_22153_kej_2019_01_004 crossref_citationtrail_10_22153_kej_2019_01_004 emarefa_primary_1242232 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 2000 |
| PublicationDate | 2019-05-28 |
| PublicationDateYYYYMMDD | 2019-05-28 |
| PublicationDate_xml | – month: 05 year: 2019 text: 2019-05-28 day: 28 |
| PublicationDecade | 2010 |
| PublicationPlace | Baghdad, Iraq |
| PublicationPlace_xml | – name: Baghdad, Iraq |
| PublicationTitle | Ai-Khawarizmi engineering journal |
| PublicationYear | 2019 |
| Publisher | University of Baghdad, al-Khwarizmi College of Engineering Al-Khwarizmi College of Engineering – University of Baghdad |
| Publisher_xml | – name: University of Baghdad, al-Khwarizmi College of Engineering – name: Al-Khwarizmi College of Engineering – University of Baghdad |
| SSID | ssib051452349 ssj0001282043 ssib036240984 |
| Score | 2.0703743 |
| Snippet | Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots... Finding a path solution in a dynamic environment represents a challenge for the robotics researchers, furthermore, it is the main issue for autonomous robots... |
| SourceID | doaj unpaywall crossref emarefa |
| SourceType | Open Website Open Access Repository Enrichment Source Index Database Publisher |
| StartPage | 108 |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LT9wwELYqLm0PVUtpu7RFPnApkrV2YsfZIxTQCglatSBxi2xnUh67CVplteLfdybxPk5w4ZjEcZyZ0cx8iecbxvbTSuoUci2IeEVoME74PPGiBBk8SBfSrr7i_CIbX-mza3O90eqL9oT19MC94IYIJ0wAowIxtUmcQFufGaKhcpWxuiPblvloA0yhJaFXRtyyrsDErAABVwQa_deXnIpCCY1hxBJKWdX_w0wwBKbDe7ijXV-jjtEz9nBbxqyO2r-r33V4jPHs9bx-cI8LN5lsRKbT9-xdTCn5Yf8qH9grqLfZ2w2iwY_scQzznpKZH_PDyb9mdtveTPkRhrCSNzX_HeXA_y7cbMp_oR-ZxgJNjlktXm9v-LK_EW8qfrloBMFY_qfxTYvPnvLbmh_37e35ybp6boddnZ5c_hyL2HRBBHReWlhjk9Q7VwHYMnWmCj6zGnFRcJlL0lGVB9BJCdY4qkqtvFJZqb2xVMNlpU8_sa26qeEL4-g5Q2UTmSWeUKB0oHTA9EQpbx0YGLDhUqxFiIzk1BhjUiAy6RRRoCIKUkQhVYGKGLAfqzseejaOJ8YekaZW44hHuzuB1lVEqRbPWdeAfY56Xj8PkxpMQwfsYKX3Z9ey-xJr-cre0JS0dSHJv7GtdjaH75gRtX6vM_7_E8r_Mw priority: 102 providerName: Directory of Open Access Journals |
| Title | Heuristic D algorithm based on particle swarm optimization for path planning of two-link robot arm in dynamic environment |
| URI | https://search.emarefa.net/detail/BIM-1242232 https://alkej.uobaghdad.edu.iq/index.php/alkej/article/download/551/514 https://doaj.org/article/9175ce51c754400cb47b654547af5746 |
| UnpaywallVersion | publishedVersion |
| Volume | 15 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAFT databaseName: Open Access Digital Library customDbUrl: eissn: 2312-0789 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001282043 issn: 2312-0789 databaseCode: KQ8 dateStart: 20050101 isFulltext: true titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html providerName: Colorado Alliance of Research Libraries – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2312-0789 dateEnd: 99991231 omitProxy: true ssIdentifier: ssj0001282043 issn: 2312-0789 databaseCode: DOA dateStart: 20050101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2312-0789 dateEnd: 99991231 omitProxy: true ssIdentifier: ssib051452349 issn: 1818-1171 databaseCode: M~E dateStart: 20050101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELaq7QE48KYsj8oHLiBl87Lj7HFLt6yQWiroSuUU2Y6zuzSPskq0Wg78dmYSZ1txACFxiZRkkontib-ZxPMNIW_CzGOhiZmDxCsOM1w6Kg6UkxpPK-NJHbb5Fadn0WzOPl7yyz3yoc-FkfmV-TZqwJYXy1R2Ceer725LHYh8EZ2Aa7vVTZFRvpKpC8DvcixovR9xcMoHZH9-dj75iuEWQJLj-23oBc4MrrWMx90PywDwLnRRIcDguKXvtAXbeoBqefzbZF0J-wBed5ryWm43Ms9vwdDJA7LsG9CtPrkaNbUa6R-_cTv-hxY-JPetq0onncgjsmfKx-TeLQLDJ2Q7M01H9UyP6SRfVOtVvSzoEUBjSquSntv70y8buS7oJ5ifCpv4ScFbhvP1kvZ1k2iV0YtN5WB4TD9XqqpBd0FXJT3elrIAHdObrLynZH4yvXg_c2wxB0fDpMgcwUUQKikzY0QaSp5pFQkG8ZaWkQzCcRZrw4LUCC4x2zVTvh-lTHGBuWHCU-EzMiir0jwnFGZknYnAiwKF0aUnjc80uD2-r4Q03AyJ249goi3TORbcyBOIeNoxT6CHExzzxPMTGPMhebu74rpj-fiD7BEaxU4O-bnbA9V6kdheTSAI5tpwXyO_oAdmz4SKOJKnyYwLFg3JgTWpG33gLIF7OyTvdib212d58S_CL8ld3MOlD0H8igzqdWNeg0dVq8P2SwRsT39OD-2b8ws5QyBH |
| linkProvider | Unpaywall |
| linkToUnpaywall | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1Lb9QwELaq7QE4lPLsFop84AJSNi87zh63tGWFRKmgK5VTZDvO7tI82lWi1fLrmUmcbcUBhMQxySQTeyaebxTPN4S8DTOPhSZmDhKvOMxw6ag4UE5qPK2MJ3XY1ld8Po-mM_bpil_tkI99LYzMr82PUQO-PF-ksis4X966LXUg8kV0Aq6dVjdFRvlKpi4EfpdjQ-vdiAMoH5Dd2fnF5DumWxCSHN9vUy8AM7jXMh53PywDiHehiwohDI5b-k7bsK0PUC2Pf1usK-EYgteDpryRm7XM83th6OwxWfQD6HafXI-aWo30z9-4Hf_DCPfJnoWqdNKJPCE7pnxKHt0jMHxGNlPTdFTP9IRO8nm1WtaLgh5DaExpVdIL-3z6bS1XBf0C61NhCz8poGW4Xi9o3zeJVhm9XFcOpsf0a6WqGnQXdFnSk00pC9BxeleV95zMzk4vP0wd28zB0bAoMkdwEYRKyswYkYaSZ1pFgkG-pWUkg3CcxdqwIDWCS6x2zZTvRylTXGBtmPBU-IIMyqo0B4TCiqwzEXhRoDC79KTxmQbY4_tKSMPNkLi9BRNtmc6x4UaeQMbT2jyBGU7Q5onnJ2DzIXm3veOmY_n4g-wxOsVWDvm52xPVap7YWU0gCebacF8jv6AHbs-EijiSp8mMCxYNyUvrUnf6ACwBvB2S91sX--u7HP6L8CvyEI9w60MQvyaDetWYI0BUtXpjv5Zfx5geIQ |
| 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%3Ajournal&rft.genre=article&rft.atitle=Heuristic+D+algorithm+based+on+particle+swarm+optimization+for+path+planning+of+two-link+robot+arm+in+dynamic+environment&rft.jtitle=Ai-Khawarizmi+engineering+journal&rft.au=Rahim%2C+Firas+Abd+al-Razzaq&rft.au=Hamid%2C+Umniyah+Ibrahim&rft.date=2019-05-28&rft.pub=University+of+Baghdad%2C+al-Khwarizmi+College+of+Engineering&rft.issn=1818-1171&rft.eissn=2312-0789&rft.volume=15&rft.issue=2&rft.spage=108&rft.epage=123&rft_id=info:doi/10.22153%2Fkej.2019.01.004&rft.externalDBID=ADJCN&rft.externalDocID=1242232 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1818-1171&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1818-1171&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1818-1171&client=summon |