Application of improved sparrow search algorithm and dynamic window method in mobile robot path planning and real‐time obstacle avoidance

In complex dynamic environments, robot path planning faces challenges in multi‐objective optimization, such as path length, smoothness and obstacle avoidance capability. To address this, this paper proposes an improved sparrow search algorithm based on chaotic initialization and the golden positive...

Full description

Saved in:
Bibliographic Details
Published inJournal of engineering (Stevenage, England) Vol. 2025; no. 1
Main Authors Shen, Lingyu, bin Ahmad Hairuddin, Muhammad Khairi Faiz
Format Journal Article
LanguageEnglish
Published 01.01.2025
Online AccessGet full text
ISSN2051-3305
2051-3305
DOI10.1049/tje2.70058

Cover

Abstract In complex dynamic environments, robot path planning faces challenges in multi‐objective optimization, such as path length, smoothness and obstacle avoidance capability. To address this, this paper proposes an improved sparrow search algorithm based on chaotic initialization and the golden positive cosine strategy for multi‐objective path planning. Diverse initial populations are generated through chaotic mapping to enhance global search capability and avoid falling into local optima. The golden positive cosine strategy optimizes individual position updates to accelerate convergence and ensure path smoothness. Results demonstrate that the proposed method outperforms sparrow search algorithm (SSA), with improvements of 21.1% in path length, 16.3% in smoothness and 14.2% in obstacle avoidance capability. After achieving global path optimization, the improved dynamic window approach (IDWA) is employed for real‐time obstacle avoidance in dynamic environments, dynamically adjusting the window size based on robot speed, obstacle density and target distance to adaptively expand or shrink the search space, thereby improving obstacle avoidance flexibility and efficiency. Simulation results show that the proposed method surpasses SSA in terms of path length, smoothness, obstacle avoidance capability and computational efficiency in both static and dynamic environments.
AbstractList In complex dynamic environments, robot path planning faces challenges in multi‐objective optimization, such as path length, smoothness and obstacle avoidance capability. To address this, this paper proposes an improved sparrow search algorithm based on chaotic initialization and the golden positive cosine strategy for multi‐objective path planning. Diverse initial populations are generated through chaotic mapping to enhance global search capability and avoid falling into local optima. The golden positive cosine strategy optimizes individual position updates to accelerate convergence and ensure path smoothness. Results demonstrate that the proposed method outperforms sparrow search algorithm (SSA), with improvements of 21.1% in path length, 16.3% in smoothness and 14.2% in obstacle avoidance capability. After achieving global path optimization, the improved dynamic window approach (IDWA) is employed for real‐time obstacle avoidance in dynamic environments, dynamically adjusting the window size based on robot speed, obstacle density and target distance to adaptively expand or shrink the search space, thereby improving obstacle avoidance flexibility and efficiency. Simulation results show that the proposed method surpasses SSA in terms of path length, smoothness, obstacle avoidance capability and computational efficiency in both static and dynamic environments.
Author Shen, Lingyu
bin Ahmad Hairuddin, Muhammad Khairi Faiz
Author_xml – sequence: 1
  givenname: Lingyu
  orcidid: 0009-0006-3161-1906
  surname: Shen
  fullname: Shen, Lingyu
  organization: Department of Engineering Universiti Malaya Kuala Lumpur Malaysia
– sequence: 2
  givenname: Muhammad Khairi Faiz
  surname: bin Ahmad Hairuddin
  fullname: bin Ahmad Hairuddin, Muhammad Khairi Faiz
  organization: Department of Engineering Universiti Malaya Kuala Lumpur Malaysia
BookMark eNp9kL1OwzAUhS1UJErpwhN4BrX4L2k6VhV_UiUWmKMb22lcOXZkm1bd2Fl4Rp6EtGVgYrpn-M6R7neJBs47jdA1JVNKxPwubTSbzgjJijM0ZCSjE85JNviTL9A4xg0hhHLBiKBD9LnoOmskJOMd9jU2bRf8ViscOwjB73DUEGSDwa59MKlpMTiF1d5BayTeGad6ptWp8Qobh1tfGatx8JVPuIPU4M6Cc8atj72gwX5_fCXTauyrmED2MGy9UeCkvkLnNdiox793hN4e7l-XT5PVy-PzcrGaSJrlqX9EzRmjQivFJNCCgYIKRC0Em3EBec4ypjnPCzKf6aKWWcFrnVMyZ4QIoQgfodvT7rvrYL8Da8sumBbCvqSkPKgsDyrLo8qevjnRMvgYg67_g38A2sR6Bg
Cites_doi 10.1016/j.eswa.2014.09.027
10.3390/s20195493
10.1007/s00521-021-06179-0
10.3390/machines10010050
10.3390/electronics12153263
10.2316/P.2011.744-054
10.1109/TIE.2020.2998740
10.1109/TIE.2020.3020024
10.1109/ICEngTechnol.2012.6396150
10.1109/ITNEC56291.2023.10082080
10.1109/SCEE.2018.8684211
10.1109/JIOT.2021.3137331
10.1109/IC3A48958.2020.233289
10.1109/ICECCT.2017.8118040
10.1016/j.future.2021.03.007
10.1088/1742-6596/2477/1/012059
10.1016/j.eswa.2023.120254
10.1007/978-3-319-23350-5_2
ContentType Journal Article
DBID AAYXX
CITATION
ADTOC
UNPAY
DOI 10.1049/tje2.70058
DatabaseName CrossRef
Unpaywall for CDI: Periodical Content
Unpaywall
DatabaseTitle CrossRef
DatabaseTitleList CrossRef
Database_xml – sequence: 1
  dbid: UNPAY
  name: Unpaywall
  url: https://proxy.k.utb.cz/login?url=https://unpaywall.org/
  sourceTypes: Open Access Repository
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2051-3305
ExternalDocumentID 10.1049/tje2.70058
10_1049_tje2_70058
GroupedDBID 0R~
1OC
24P
5VS
AAHJG
AAJGR
AAMMB
AAYXX
ABJCF
ABQXS
ACCMX
ACESK
ACXQS
ADBBV
ADMLS
AEFGJ
AFFHD
AFKRA
AGXDD
AIDQK
AIDYY
ALMA_UNASSIGNED_HOLDINGS
ARAPS
AVUZU
BCNDV
BENPR
BGLVJ
CCPQU
CITATION
EBS
GROUPED_DOAJ
HCIFZ
IAO
IDLOA
IGS
IPNFZ
ITC
KQ8
M43
M7S
M~E
OK1
PHGZM
PHGZT
PIMPY
PQGLB
PTHSS
RIG
RNS
ROL
RUI
WIN
ADTOC
PUEGO
UNPAY
ID FETCH-LOGICAL-c156t-33d92214edd2ca182adaba4f442734a66252e3368097e8fc583fe610920044d03
IEDL.DBID UNPAY
ISSN 2051-3305
IngestDate Sun Sep 07 10:50:32 EDT 2025
Wed Oct 29 21:31:41 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License cc-by
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c156t-33d92214edd2ca182adaba4f442734a66252e3368097e8fc583fe610920044d03
ORCID 0009-0006-3161-1906
OpenAccessLink https://proxy.k.utb.cz/login?url=https://doi.org/10.1049/tje2.70058
ParticipantIDs unpaywall_primary_10_1049_tje2_70058
crossref_primary_10_1049_tje2_70058
PublicationCentury 2000
PublicationDate 2025-01-00
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – month: 01
  year: 2025
  text: 2025-01-00
PublicationDecade 2020
PublicationTitle Journal of engineering (Stevenage, England)
PublicationYear 2025
References e_1_2_9_20_1
e_1_2_9_11_1
e_1_2_9_21_1
e_1_2_9_13_1
Chen W. (e_1_2_9_19_1) 2023; 12940
e_1_2_9_24_1
e_1_2_9_12_1
e_1_2_9_23_1
e_1_2_9_7_1
Gigras Y. (e_1_2_9_8_1) 2014; 85
e_1_2_9_5_1
e_1_2_9_4_1
e_1_2_9_3_1
e_1_2_9_2_1
Sood M. (e_1_2_9_10_1) 2020; 19
e_1_2_9_9_1
Yang Z. (e_1_2_9_22_1) 2023; 2023
e_1_2_9_15_1
Panov S. (e_1_2_9_6_1) 2015; 7
e_1_2_9_14_1
e_1_2_9_25_1
e_1_2_9_17_1
e_1_2_9_16_1
e_1_2_9_18_1
References_xml – ident: e_1_2_9_17_1
  doi: 10.1016/j.eswa.2014.09.027
– ident: e_1_2_9_3_1
  doi: 10.3390/s20195493
– volume: 7
  start-page: 35
  issue: 1
  year: 2015
  ident: e_1_2_9_6_1
  article-title: Metaheuristic global path planning algorithm for mobile robots
  publication-title: Int. J. Reason.‐based Intell. Syst.
– ident: e_1_2_9_9_1
  doi: 10.1007/s00521-021-06179-0
– ident: e_1_2_9_20_1
  doi: 10.3390/machines10010050
– ident: e_1_2_9_14_1
  doi: 10.3390/electronics12153263
– ident: e_1_2_9_24_1
  doi: 10.2316/P.2011.744-054
– volume: 85
  start-page: 26
  issue: 5
  year: 2014
  ident: e_1_2_9_8_1
  article-title: Metaheuristic algorithm for robotic path planning
  publication-title: Int. J. Comput. Appl.
– ident: e_1_2_9_5_1
  doi: 10.1109/TIE.2020.2998740
– volume: 2023
  year: 2023
  ident: e_1_2_9_22_1
  article-title: Mobile robot path planning based on improved particle swarm optimization and improved dynamic window approach
  publication-title: J. Robot.
– ident: e_1_2_9_21_1
  doi: 10.1109/TIE.2020.3020024
– volume: 19
  start-page: 36
  issue: 1
  year: 2020
  ident: e_1_2_9_10_1
  article-title: Meta‐heuristic techniques for path planning: recent trends and advancements
  publication-title: Int. J. Intell. Syst. Technol. Appl.
– ident: e_1_2_9_12_1
– ident: e_1_2_9_7_1
  doi: 10.1109/ICEngTechnol.2012.6396150
– ident: e_1_2_9_23_1
  doi: 10.1109/ITNEC56291.2023.10082080
– ident: e_1_2_9_25_1
  doi: 10.1109/SCEE.2018.8684211
– ident: e_1_2_9_11_1
  doi: 10.1109/JIOT.2021.3137331
– ident: e_1_2_9_13_1
  doi: 10.1109/IC3A48958.2020.233289
– ident: e_1_2_9_16_1
  doi: 10.1109/ICECCT.2017.8118040
– volume: 12940
  start-page: 129401C
  year: 2023
  ident: e_1_2_9_19_1
  article-title: Path planning based on fuzzy‐control dynamic window approach
  publication-title: Proc. SPIE
– ident: e_1_2_9_4_1
  doi: 10.1016/j.future.2021.03.007
– ident: e_1_2_9_18_1
  doi: 10.1088/1742-6596/2477/1/012059
– ident: e_1_2_9_2_1
  doi: 10.1016/j.eswa.2023.120254
– ident: e_1_2_9_15_1
  doi: 10.1007/978-3-319-23350-5_2
SSID ssj0001342041
Score 2.3042445
Snippet In complex dynamic environments, robot path planning faces challenges in multi‐objective optimization, such as path length, smoothness and obstacle avoidance...
SourceID unpaywall
crossref
SourceType Open Access Repository
Index Database
Title Application of improved sparrow search algorithm and dynamic window method in mobile robot path planning and real‐time obstacle avoidance
URI https://doi.org/10.1049/tje2.70058
UnpaywallVersion publishedVersion
Volume 2025
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAFT
  databaseName: Open Access Digital Library
  customDbUrl:
  eissn: 2051-3305
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001342041
  issn: 2051-3305
  databaseCode: KQ8
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: http://grweb.coalliance.org/oadl/oadl.html
  providerName: Colorado Alliance of Research Libraries
– providerCode: PRVEBS
  databaseName: Inspec with Full Text
  customDbUrl:
  eissn: 2051-3305
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001342041
  issn: 2051-3305
  databaseCode: ADMLS
  dateStart: 20190101
  isFulltext: true
  titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text
  providerName: EBSCOhost
– providerCode: PRVBHI
  databaseName: IET Digital Library Open Access
  customDbUrl:
  eissn: 2051-3305
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001342041
  issn: 2051-3305
  databaseCode: IDLOA
  dateStart: 20130601
  isFulltext: true
  titleUrlDefault: https://digital-library.theiet.org/content/collections
  providerName: Institution of Engineering and Technology
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2051-3305
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001342041
  issn: 2051-3305
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 2051-3305
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001342041
  issn: 2051-3305
  databaseCode: BENPR
  dateStart: 20210201
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVWIB
  databaseName: KBPluse Wiley Online Library: Open Access
  customDbUrl:
  eissn: 2051-3305
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001342041
  issn: 2051-3305
  databaseCode: AVUZU
  dateStart: 20130601
  isFulltext: true
  titleUrlDefault: https://www.kbplus.ac.uk/kbplus7/publicExport/pkg/559
  providerName: Wiley-Blackwell
– providerCode: PRVWIB
  databaseName: Wiley Online Library Open Access
  customDbUrl:
  eissn: 2051-3305
  dateEnd: 99991231
  omitProxy: true
  ssIdentifier: ssj0001342041
  issn: 2051-3305
  databaseCode: 24P
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://authorservices.wiley.com/open-science/open-access/browse-journals.html
  providerName: Wiley-Blackwell
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NT8JAEJ0gHIwHv40aJRPlWoR2W9ojQQkxQkyUBE9kv6ootoQUiZ68e_E3-kucpaDggXhsMpNuZqa78zrtewAFJwwDqRxu-b5kFpPCsXyvTFCF-TxQrtRKG6DYbHmNNrvsuJ0MnMz-hVmY37PgLHnUdrFixO9WIOe51G9nIdduXVfvjGocVZRFgNyd8Y4uOCycNKujaMBfx7zfnzs-6htQm904_WrkqThKRFG-_eFkXL6yTVifdo9YTdO9BRkdbcPaHKfgDnxUf0fSGIfYm7w10App6zB8i5jWNvL-fTzsJQ_PyCOFKhWmxzFBdLJJdaWxF-FzLGjfwGEs4gSNfDEOpjJHEz9qOftf759GoR5jQZ0mLQv5S9xTppp2oV2_uK01rKnigiUJxyUUSxXYdplppWzJCXpwxQVnIWOGBYd7BJZs7TieXwoq2g-l6zuhNoTt5lljquTsQTaKI70PKKjVkBXyYqrChHQCrQJp-6EKBV0JfQCns-x0BymxRncyEGdB14S2OwntARR-ErfE7PB_ZkeQTYYjfUxtRCLykKueN69u8tN6-gYWMc3W
linkProvider Unpaywall
linkToUnpaywall http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS8NAEF5qexAPvsWKyqC9prbJJk2OpViKYPFgoZ7CvqLRNCkltejJuxd_o7_E2Ty09SAeAzNkmZnszpdJvo-QhhUEnpAWM1xXUIMKbhmu00aoQl3mSVsoqTRQvB46gxG9GtvjCjkr_4VZmd9T7yJ9VGazo8Xv1kjNsbHfrpLaaHjTvdOqcVhRBgJyu-QdXXFYOWnW5_GUvSxYFC0dH_0t0itvnH818tScp7wpXn9xMv69sm2yWXSP0M3TvUMqKt4lG0ucgnvkvfszkoYkgDB7a6Ak4Nah-RYhr21g0X0yC9OHCbBYgsyF6WGBEB1tcl1pCGOYJBz3DZglPElByxfDtJA5yvyw5Yw-3z60Qj0kHDtNXBaw5ySUupr2yah_edsbGIXigiEQx6UYS-mZZpsqKU3BEHowyTijAaWaBYc5CJZMZVmO2_I6yg2E7VqB0oTt-lmjsmUdkGqcxOqQAMdWQ3TQi8oO5cLylPSE6QYy4HjFVZ2cl9nxpzmxhp8NxKnn69D6WWjrpPGduD_Mjv5ndkyq6WyuTrCNSPlpUUdfr2PMQg
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=Application+of+improved+sparrow+search+algorithm+and+dynamic+window+method+in+mobile+robot+path+planning+and+real%E2%80%90time+obstacle+avoidance&rft.jtitle=Journal+of+engineering+%28Stevenage%2C+England%29&rft.au=Shen%2C+Lingyu&rft.au=bin+Ahmad+Hairuddin%2C+Muhammad+Khairi+Faiz&rft.date=2025-01-01&rft.issn=2051-3305&rft.eissn=2051-3305&rft.volume=2025&rft.issue=1&rft_id=info:doi/10.1049%2Ftje2.70058&rft.externalDBID=n%2Fa&rft.externalDocID=10_1049_tje2_70058
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2051-3305&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2051-3305&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2051-3305&client=summon