Path Planning with Adaptive Autonomy Based on an Improved A∗ Algorithm and Dynamic Programming for Mobile Robots

Sustainable path-planning algorithms are essential for executing complex user-defined missions by mobile robots. Addressing various scenarios with a unified criterion during the design phase is often impractical due to the potential for unforeseen situations. Therefore, it is important to incorporat...

Full description

Saved in:

Bibliographic Details
Published in:	Information (Basel) Vol. 16; no. 8; p. 700
Main Authors:	Aatif, Muhammad, Baig, Muhammad Zeeshan, Adeel, Umar, Rashid, Ammar
Format:	Journal Article
Language:	English
Published:	Basel MDPI AG 01.08.2025
Subjects:	Algorithms artificial intelligence Autonomy data-driven learning-based Decision making Decomposition Dynamic programming Efficiency Machine learning mobile robots path planning Planning Real time Robots Segments Shortest-path problems Straight lines
ISSN:	2078-2489, 2078-2489
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Abstract	Sustainable path-planning algorithms are essential for executing complex user-defined missions by mobile robots. Addressing various scenarios with a unified criterion during the design phase is often impractical due to the potential for unforeseen situations. Therefore, it is important to incorporate the concept of adaptive autonomy for path planning. This approach allows the system to autonomously select the best path-planning strategy. The technique utilizes dynamic programming with an adaptive memory size, leveraging a cellular decomposition technique to divide the map into convex cells. The path is divided into three segments: the first segment connects the starting point to the center of the starting cell, the second segment connects the center of the goal cell to the goal point, and the third segment connects the center of the starting cell to the center of the goal cell. Since each cell is convex, internal path planning simply requires a straight line between two points within a cell. Path planning uses an improved A∗ (I-A∗) algorithm, which evaluates the feasibility of a direct path to the goal from the current position during execution. When a direct path is discovered, the algorithm promptly returns and saves it in memory. The memory size is proportional to the square of the total number of cells, and it stores paths between the centers of cells. By storing and reusing previously calculated paths, this method significantly reduces redundant computation and supports long-term sustainability in mobile robot deployments. The final phase of the path-planning process involves pruning, which eliminates unnecessary waypoints. This approach obviates the need for repetitive path planning across different scenarios thanks to its compact memory size. As a result, paths can be swiftly retrieved from memory when needed, enabling efficient and prompt navigation. Simulation results indicate that this algorithm consistently outperforms other algorithms in finding the shortest path quickly.
AbstractList	Sustainable path-planning algorithms are essential for executing complex user-defined missions by mobile robots. Addressing various scenarios with a unified criterion during the design phase is often impractical due to the potential for unforeseen situations. Therefore, it is important to incorporate the concept of adaptive autonomy for path planning. This approach allows the system to autonomously select the best path-planning strategy. The technique utilizes dynamic programming with an adaptive memory size, leveraging a cellular decomposition technique to divide the map into convex cells. The path is divided into three segments: the first segment connects the starting point to the center of the starting cell, the second segment connects the center of the goal cell to the goal point, and the third segment connects the center of the starting cell to the center of the goal cell. Since each cell is convex, internal path planning simply requires a straight line between two points within a cell. Path planning uses an improved A∗ (I- A∗ ) algorithm, which evaluates the feasibility of a direct path to the goal from the current position during execution. When a direct path is discovered, the algorithm promptly returns and saves it in memory. The memory size is proportional to the square of the total number of cells, and it stores paths between the centers of cells. By storing and reusing previously calculated paths, this method significantly reduces redundant computation and supports long-term sustainability in mobile robot deployments. The final phase of the path-planning process involves pruning, which eliminates unnecessary waypoints. This approach obviates the need for repetitive path planning across different scenarios thanks to its compact memory size. As a result, paths can be swiftly retrieved from memory when needed, enabling efficient and prompt navigation. Simulation results indicate that this algorithm consistently outperforms other algorithms in finding the shortest path quickly. Sustainable path-planning algorithms are essential for executing complex user-defined missions by mobile robots. Addressing various scenarios with a unified criterion during the design phase is often impractical due to the potential for unforeseen situations. Therefore, it is important to incorporate the concept of adaptive autonomy for path planning. This approach allows the system to autonomously select the best path-planning strategy. The technique utilizes dynamic programming with an adaptive memory size, leveraging a cellular decomposition technique to divide the map into convex cells. The path is divided into three segments: the first segment connects the starting point to the center of the starting cell, the second segment connects the center of the goal cell to the goal point, and the third segment connects the center of the starting cell to the center of the goal cell. Since each cell is convex, internal path planning simply requires a straight line between two points within a cell. Path planning uses an improved A[sup.∗] (I-A[sup.∗]) algorithm, which evaluates the feasibility of a direct path to the goal from the current position during execution. When a direct path is discovered, the algorithm promptly returns and saves it in memory. The memory size is proportional to the square of the total number of cells, and it stores paths between the centers of cells. By storing and reusing previously calculated paths, this method significantly reduces redundant computation and supports long-term sustainability in mobile robot deployments. The final phase of the path-planning process involves pruning, which eliminates unnecessary waypoints. This approach obviates the need for repetitive path planning across different scenarios thanks to its compact memory size. As a result, paths can be swiftly retrieved from memory when needed, enabling efficient and prompt navigation. Simulation results indicate that this algorithm consistently outperforms other algorithms in finding the shortest path quickly.
Audience	Academic
Author	Rashid, Ammar Baig, Muhammad Zeeshan Aatif, Muhammad Adeel, Umar
Author_xml	– sequence: 1 givenname: Muhammad orcidid: 0000-0003-1924-784X surname: Aatif fullname: Aatif, Muhammad – sequence: 2 givenname: Muhammad Zeeshan orcidid: 0000-0002-0902-9497 surname: Baig fullname: Baig, Muhammad Zeeshan – sequence: 3 givenname: Umar orcidid: 0000-0002-1779-4877 surname: Adeel fullname: Adeel, Umar – sequence: 4 givenname: Ammar orcidid: 0000-0002-8642-6218 surname: Rashid fullname: Rashid, Ammar
BookMark	eNpNkd1uFCEUx4lpE2vtnQ9A4q1b-RgGuBzr1yY1bpr2mhwYGNnMwMrM1uwb-Aa-n08i6xpTuIAD5__jcP4v0FnKySP0ipJrzjV5G1PItCWKSEKeoQtGpFqxRumzJ_vn6Gqet6QOKVWj6AUqG1i-4c0IKcU04B-xRl0PuyU-etztl5zydMDvYPY9zglDwutpV_JjDbvfP3_hbhxyqaKpXvX4_SHBFB3elDwUmKYjMuSCv2QbR4_vss3L_BKdBxhnf_VvvUQPHz_c33xe3X79tL7pbleOt2JZNcFKBsL1LICyrWUyaLAKhOTESUtkT1lPfZBcOqob4LqllttWCKW4UoFfovWJ22fYml2JE5SDyRDN34NcBgNliW70xjslNGG8Ba8b5hxwx1V9goZgRetFZb0-serfv-_9vJht3pdUyzecNQ3hWjFds65PWQNU6NGQpYCrs_e1K9WuULtgOiV4qySVvArenASu5HkuPvwvkxJzdNU8dZX_Ad64lzI
Cites_doi	10.1017/S0263574714000514 10.1007/s12555-011-0417-7 10.3390/s24062011 10.3390/s23146647 10.3390/act12030106 10.1109/TSSC.1968.300136 10.1109/ROBOT.2007.363555 10.1007/978-3-642-02094-0 10.4028/www.scientific.net/AMM.607.778 10.1007/978-3-031-35308-6_10 10.1109/70.88137 10.47611/jsrhs.v12i3.4790 10.1017/CBO9780511546877 10.1007/978-3-319-46475-6_7 10.1109/CVPRW.2017.70 10.1088/0741-3335/28/1A/022 10.1177/027836402320556421 10.15607/RSS.2005.I.009 10.1109/ROBOT.2007.364024 10.3390/agriculture12091445 10.1016/j.asoc.2024.111503 10.24963/ijcai.2017/700 10.54097/hset.v16i.2508 10.1109/ICRA.2011.5980409 10.1007/s10111-009-0134-7
ContentType	Journal Article
Copyright	COPYRIGHT 2025 MDPI AG 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml	– notice: COPYRIGHT 2025 MDPI AG – notice: 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID	AAYXX CITATION 3V. 7SC 7XB 8AL 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PIMPY PKEHL PQEST PQGLB PQQKQ PQUKI Q9U DOA
DOI	10.3390/info16080700
DatabaseName	CrossRef ProQuest Central (Corporate) Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central Technology collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest - Publicly Available Content Database ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central Basic DOAJ: Directory of Open Access Journals
DatabaseTitle	CrossRef Publicly Available Content Database Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni)
DatabaseTitleList	Publicly Available Content Database 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: PIMPY name: Publicly Available Content Database url: http://search.proquest.com/publiccontent sourceTypes: Aggregation Database
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	2078-2489
ExternalDocumentID	oai_doaj_org_article_ec8590236ae942cca3c38b071ffb56e5 A853687173 10_3390_info16080700
GroupedDBID	.4I 5VS 8FE 8FG AADQD AAFWJ AAYXX ABDBF ABUWG ADBBV ADMLS AFFHD AFKRA AFPKN AFZYC ALMA_UNASSIGNED_HOLDINGS ARAPS AZQEC BCNDV BENPR BGLVJ BPHCQ CCPQU CITATION DWQXO GNUQQ GROUPED_DOAJ HCIFZ IAO ITC K6V K7- KQ8 MK~ ML~ MODMG M~E OK1 P2P P62 PHGZM PHGZT PIMPY PQGLB PQQKQ PROAC XH6 3V. 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D M0N PKEHL PQEST PQUKI Q9U
ID	FETCH-LOGICAL-c365t-4fb72a5cd2fa8b6b27f9ab8a5730c7b07d12d1ef737c194a3961b3b65588388f3
IEDL.DBID	DOA
ISICitedReferencesCount	0
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001557674800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	2078-2489
IngestDate	Fri Oct 03 12:37:43 EDT 2025 Sat Nov 01 12:18:38 EDT 2025 Tue Nov 04 18:11:01 EST 2025 Sat Nov 29 07:14:19 EST 2025
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Issue	8
Language	English
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c365t-4fb72a5cd2fa8b6b27f9ab8a5730c7b07d12d1ef737c194a3961b3b65588388f3
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0003-1924-784X 0000-0002-1779-4877 0000-0002-0902-9497 0000-0002-8642-6218
OpenAccessLink	https://doaj.org/article/ec8590236ae942cca3c38b071ffb56e5
PQID	3244039829
PQPubID	2032384
ParticipantIDs	doaj_primary_oai_doaj_org_article_ec8590236ae942cca3c38b071ffb56e5 proquest_journals_3244039829 gale_infotracacademiconefile_A853687173 crossref_primary_10_3390_info16080700
PublicationCentury	2000
PublicationDate	2025-08-01
PublicationDateYYYYMMDD	2025-08-01
PublicationDate_xml	– month: 08 year: 2025 text: 2025-08-01 day: 01
PublicationDecade	2020
PublicationPlace	Basel
PublicationPlace_xml	– name: Basel
PublicationTitle	Information (Basel)
PublicationYear	2025
Publisher	MDPI AG
Publisher_xml	– name: MDPI AG
References	Yang (ref_31) 2011; 9 Hsu (ref_16) 2002; 21 Yao (ref_4) 2015; 33 ref_14 ref_13 ref_12 ref_11 ref_19 ref_17 ref_15 Borenstein (ref_9) 1991; 7 Wesson (ref_30) 1986; 28 ref_25 ref_24 ref_23 ref_22 Zhang (ref_26) 2022; 16 Zheng (ref_28) 2023; 12 ref_20 Noreen (ref_10) 2016; 7 Hart (ref_18) 1968; 4 ref_3 ref_2 ref_29 ref_27 ref_8 Mehmet (ref_1) 2024; 158 Botea (ref_33) 2004; 1 ref_5 ref_7 Zieba (ref_21) 2010; 12 Tang (ref_32) 2014; 607 ref_6
References_xml	– ident: ref_7 – volume: 33 start-page: 611 year: 2015 ident: ref_4 article-title: Unmanned aerial vehicle dynamic path planning in an uncertain environment publication-title: Robotica doi: 10.1017/S0263574714000514 – volume: 9 start-page: 750 year: 2011 ident: ref_31 article-title: Anytime synchronized-biased-greedy rapidly-exploring random tree path planning in two dimensional complex environments publication-title: Int. J. Control Autom. Syst. doi: 10.1007/s12555-011-0417-7 – ident: ref_25 doi: 10.3390/s24062011 – ident: ref_27 doi: 10.3390/s23146647 – ident: ref_5 – volume: 1 start-page: 1 year: 2004 ident: ref_33 article-title: Near optimal hierarchical path-finding publication-title: J. Game Dev. – ident: ref_24 doi: 10.3390/act12030106 – volume: 4 start-page: 100 year: 1968 ident: ref_18 article-title: A formal basis for the heuristic determination of minimum cost paths publication-title: IEEE Trans. Syst. Sci. Cybern. doi: 10.1109/TSSC.1968.300136 – ident: ref_17 doi: 10.1109/ROBOT.2007.363555 – ident: ref_19 doi: 10.1007/978-3-642-02094-0 – volume: 607 start-page: 778 year: 2014 ident: ref_32 article-title: Comparison between Normal Waveform and Modified Wavefront Path Planning Algorithm for Mobile Robot publication-title: Appl. Mech. Mater. doi: 10.4028/www.scientific.net/AMM.607.778 – ident: ref_2 doi: 10.1007/978-3-031-35308-6_10 – volume: 7 start-page: 278 year: 1991 ident: ref_9 article-title: The vector field histogram-fast obstacle avoidance for mobile robots publication-title: IEEE Trans. Robot. Autom. doi: 10.1109/70.88137 – volume: 12 start-page: 1 year: 2023 ident: ref_28 article-title: Scouting robot with search-space reducing hybrid networks for unknown environment path planning publication-title: J. Stud. Res. doi: 10.47611/jsrhs.v12i3.4790 – ident: ref_3 doi: 10.1017/CBO9780511546877 – ident: ref_13 doi: 10.1007/978-3-319-46475-6_7 – ident: ref_12 doi: 10.1109/CVPRW.2017.70 – ident: ref_23 – volume: 28 start-page: 243 year: 1986 ident: ref_30 article-title: Sawtooth oscillations publication-title: Plasma Phys. Control. Fusion doi: 10.1088/0741-3335/28/1A/022 – volume: 7 start-page: 97 year: 2016 ident: ref_10 article-title: Optimal path planning using RRT* based approaches: A survey and future directions publication-title: Int. J. Adv. Comput. Sci. Appl – volume: 21 start-page: 233 year: 2002 ident: ref_16 article-title: Randomized kinodynamic motion planning with moving obstacles publication-title: Int. J. Robot. Res. doi: 10.1177/027836402320556421 – ident: ref_11 doi: 10.15607/RSS.2005.I.009 – ident: ref_8 doi: 10.1109/ROBOT.2007.364024 – ident: ref_29 doi: 10.3390/agriculture12091445 – volume: 158 start-page: 111503 year: 2024 ident: ref_1 article-title: Dynamic Path Planning via Dueling Double Deep Q-Network (D3QN) with Prioritized Experience Replay publication-title: Appl. Soft Comput. doi: 10.1016/j.asoc.2024.111503 – ident: ref_6 doi: 10.24963/ijcai.2017/700 – ident: ref_15 – volume: 16 start-page: 279 year: 2022 ident: ref_26 article-title: Mobile robot path planning in 2d space: A survey publication-title: Highlights Sci. Eng. Technol. doi: 10.54097/hset.v16i.2508 – ident: ref_14 doi: 10.1109/ICRA.2011.5980409 – volume: 12 start-page: 193 year: 2010 ident: ref_21 article-title: Principles of adjustable autonomy: A framework for resilient human–machine cooperation publication-title: Cogn. Technol. Work doi: 10.1007/s10111-009-0134-7 – ident: ref_22 – ident: ref_20
SSID	ssj0000778481
Score	2.321589
Snippet	Sustainable path-planning algorithms are essential for executing complex user-defined missions by mobile robots. Addressing various scenarios with a unified...
SourceID	doaj proquest gale crossref
SourceType	Open Website Aggregation Database Index Database
StartPage	700
SubjectTerms	Algorithms artificial intelligence Autonomy data-driven learning-based Decision making Decomposition Dynamic programming Efficiency Machine learning mobile robots path planning Planning Real time Robots Segments Shortest-path problems Straight lines
SummonAdditionalLinks	– databaseName: ProQuest Central dbid: BENPR link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3LbtQwFLWg7YIueJWKgYK8oGIVdWLHj6xQprRiw2hUUam7yM9SqU2GTNpv4A_4P76EexNPOxvYsEwcOZbO9X35-lxCPggTdREhLImaQYDiWMggzopZrrV00k-jZGOzCTWf64uLcpESbqtUVrnWiYOi9q3DHPkRGP5iykvNyk_LHxl2jcLT1dRC4zHZRqYykPPt2cl8cXafZZkqhXzxY8U7h_j-CHHLJfhJCi-1bdiigbL_b4p5sDanz_53nc_J0-Rn0moUjBfkUWhekt0N9sE90i3A-6PrrkUUM7K08maJCpBWt_1w3YHOwMx52jbUNHTMQMBj9fvnL1pdX8KP--83MOTp57G1PV2MBV83OCU4xPRra0Hx0LPWtv3qFTk_Pfl2_CVLLRgyx6XosyJaxYxwnkWjrbRMxdJYbQQoBqfsVPmc-TxExZXLy8LwUuaWWymE1hww5_tkq2mb8JrQ3MB218ZAjGkL7a0OwUReimBYlIrHCTlcg1EvR6aNGiIUBK3eBG1CZojU_TfIjz28aLvLOm23OjiNvDRcmlAWDKSUO65huXmMVsggJuQj4jxM3HfGmXQZAZaKfFh1BV6M1FihMCEHa5zrtL1X9QPIb_49_JY8YdgweKgYPCBbfXcb3pEdd9dfrbr3SVr_APcg9iM priority: 102 providerName: ProQuest
Title	Path Planning with Adaptive Autonomy Based on an Improved A∗ Algorithm and Dynamic Programming for Mobile Robots
URI	https://www.proquest.com/docview/3244039829 https://doaj.org/article/ec8590236ae942cca3c38b071ffb56e5
Volume	16
WOSCitedRecordID	wos001557674800001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: DOA dateStart: 20100101 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: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: M~E dateStart: 20100101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre – providerCode: PRVPQU databaseName: Advanced Technologies & Aerospace Database customDbUrl: eissn: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: P5Z dateStart: 20100301 isFulltext: true titleUrlDefault: https://search.proquest.com/hightechjournals providerName: ProQuest – providerCode: PRVPQU databaseName: Computer Science Database customDbUrl: eissn: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: K7- dateStart: 20100301 isFulltext: true titleUrlDefault: http://search.proquest.com/compscijour providerName: ProQuest – providerCode: PRVPQU databaseName: ProQuest Central customDbUrl: eissn: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: BENPR dateStart: 20100301 isFulltext: true titleUrlDefault: https://www.proquest.com/central providerName: ProQuest – providerCode: PRVPQU databaseName: Publicly Available Content Database customDbUrl: eissn: 2078-2489 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000778481 issn: 2078-2489 databaseCode: PIMPY dateStart: 20100301 isFulltext: true titleUrlDefault: http://search.proquest.com/publiccontent providerName: ProQuest
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV3NbtQwELaqlgMcUPkTS0vlQytOUTd2_HfMwlZU1a6iCqTCJbIdG1WiSZVNOfbMG_B-PAljO4tyQVx6sZQ4cayZeGY-a_wNQsdMe1l4gCVeEgAolrgMcJbPcim55c3cc5KKTYj1Wl5dqWpS6ivkhCV64CS4U2dlYBihXDtVEPgetVQacIzeG8ZdZC-dCzUBU9EGCxF44lOmOwVcfxr0lXOIj0Q4zDbxQZGq_18GOXqZs330dAwPcZmm9QztuPY5ejIhDXyB-gqCNrwtNoTDRiouG30b7BYu74Z4SgEvwDs1uGuxbnHaOIDL8vfPX7j8_q3r4aUb6Grwh1SRHlcpT-smDAlxLF51BuwFvuxMN2xeos9ny0_vP2Zj5YTMUs6GrPBGEM1sQ7yWhhsivNJGagbr2QqQXpOTJndeUGFzVWiqeG6o4YxJSUFV9BXabbvWvUY417BKpdYADU0hGyOd054q5jTxXFA_QydbWda3iSCjBmARZF5PZT5DiyDov88EWut4A5Rdj8qu_6fsGXoX1BQHHnpt9XiGAKYaaKzqEoIPLkNiwQwdbjVZj6tyU0PwWMypkkS9eYjZHKDHJFQDjumAh2h36O_cW_TI_hiuN_0R2lss19XlUfwxob0QGbSr-yW0FfsK_dX5qvryB9Su7YU
linkProvider	Directory of Open Access Journals
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3LbtQwFL0qUyRgwRsxUMALKlZREzuxnQVCGdqqVdvRqCpSd8F27FKJSYZMCuof8Af8BR_Fl3CdR5kN7LpgmYcsOz6-r9x7D8DrRDkZO3RLnKTooBhqA_SzXBBJyQ0vQsdpRzYhplN5eprO1uDnUAvj0yoHmdgK6qIyPka-hYo_Dlkqafpu8SXwrFH-7-pAodHB4sBefkOXbfl2fxv3d5PS3Z2T93tBzyoQGMaTJoidFlQlpqBOSc01FS5VWqoEsW6EDkUR0SKyTjBh0MNXLOWRZponiZQMl8Fw3BuwHrOYJyNYn-xMZ8dXUZ1QCN-fvsuwZywNtzxOIo52mfBFdCu6r6UI-JsiaLXb7r3_7bvch7u9HU2yDvgPYM2WD-HOSnfFR1DP0LolAysT8RFnkhVq4QU8yS6atpyDTFCNF6QqiSpJF2HBy-zX9x8k-3yGC20-zfFRQbYvSzU_N2TWJbTN_ZBo8JOjSqNgJceVrprlY_hwLYt-AqOyKu1TIJFCcSaVQh9ax7LQ0lrlWJpYRR0XzI1hc9j8fNF1EsnRA_MgyVdBMoaJR8bVO77_d3ujqs_yXpzk1kjfd4dxZdOY4ilkhkmcbuScTrhNxvDG46oduKmVUX2xBU7V9_vKM7TSuPQZGGPYGHCV9-Jrmf8B1bN_P34Ft_ZOjg7zw_3pwXO4TT05cpsduQGjpr6wL-Cm-dqcL-uX_Ukh8PG6QfgbjjZS-A
linkToPdf	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3NbtQwEB6VghAc-EcsFPCBilO0iZ3YzgGhlGVFVVhFCKSKS7Adu1RikyWbgvoGvAHvwuPwJIzzU_YCtx44Jo4sO_k8M99kfgCeJMrJ2CEtcZIiQTHUBsizXBBJyQ0vQ8dp32xCLBby8DDNt-DnmAvjwypHmdgJ6rI23kc-RcUfhyyVNJ26ISwin82fr74EvoOU_9M6ttPoIXJgT78hfVs_25_ht96ldP7y3YtXwdBhIDCMJ20QOy2oSkxJnZKaaypcqrRUCeLeCB2KMqJlZJ1gwiDbVyzlkWaaJ4mUDLfEcN4LcFHEXPpwsjz5cObfCYXwler7WHvG0nDqERNxtNCET6fb0IJds4C_qYROz82v_89v6AZcG6xrkvXH4SZs2eoWXN2ouXgbmhxtXjL2aiLeD02yUq282CfZSdsleZA9VO4lqSuiKtL7XfAy-_X9B8k-H-FG209LHCrJ7LRSy2ND8j7MbemnRBpA3tQaxS15W-u6Xd-B9-ey6buwXdWVvQckUijkpFLIrHUsSy2tVY6liVXUccHcBHZHIBSrvr5IgbzMA6bYBMwE9jxKzp7xVcG7G3VzVAxCprBG-mo8jCubxhTPJjNM4nIj53TCbTKBpx5j3cRto4waUjBwqb4KWJGh7calj8uYwM6IsWIQauviD8Du_3v4MVxG5BWv9xcHD-AK9R2Tu5DJHdhumxP7EC6Zr-3xunnUHRkCH88bgb8BCBVajQ
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=Path+Planning+with+Adaptive+Autonomy+Based+on+an+Improved+A%E2%88%97+Algorithm+and+Dynamic+Programming+for+Mobile+Robots&rft.jtitle=Information+%28Basel%29&rft.au=Muhammad+Aatif&rft.au=Muhammad+Zeeshan+Baig&rft.au=Umar+Adeel&rft.au=Ammar+Rashid&rft.date=2025-08-01&rft.pub=MDPI+AG&rft.eissn=2078-2489&rft.volume=16&rft.issue=8&rft.spage=700&rft_id=info:doi/10.3390%2Finfo16080700&rft.externalDBID=DOA&rft.externalDocID=oai_doaj_org_article_ec8590236ae942cca3c38b071ffb56e5
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2078-2489&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2078-2489&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2078-2489&client=summon