Navigational Analysis of Legged Robot using the Modified African Vulture Optimization Algorithm

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract The main challenges in the legged robot are navigation, obstacle avoidance, and path development. This study uses a swarm intelligence based meta-heuristic technique the Modified African Vulture Optimization Algorithm (MAVOA), to address the optimum path planning problem. The developed algorithm imitates the foraging behaviour of vultures. The MAVOA dynamically adjusts the movement of vultures to equate exploration and exploitation. This technique is selected to get the optimum path by avoiding obstacles while navigating a legged robot in an unfamiliar, congested environment. When it comes to the legged robot navigation, the path planning problem is solved by selecting four governing constraints: front-side hurdle length (FHL), left-side hurdle length (LHL), right-side hurdle length (RHL), and the direction of turn (DT) that are considered as the inputs and outputs respectively. The main constraints of earlier researches on existing techniques are impotence to account for motion in new environments, challenges in navigating crowded and complex areas, and the need to optimize intricate pathways. The WEBOT software is chosen for simulating a navigation of a legged robot, and result of simulation is differentiated to experimental outputs configured in a lab setting. Both outcomes show that the legged robot successfully navigated to its objectives while avoiding impediments. After the findings were assessed, it was found that there was less than 5% difference between the output of the simulation and the experiment. The approach can be applied to multiple-purpose or discrete optimization issues and future complicated engineering and science disciplines.
Full text 11,610 characters · extracted from preprint-html · click to expand
Navigational Analysis of Legged Robot using the Modified African Vulture Optimization Algorithm | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Navigational Analysis of Legged Robot using the Modified African Vulture Optimization Algorithm Pinaki Das, Dayal R. Parhi, Abhijit Mahapatro, Himansu Sekhar Dash, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-6004194/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract The main challenges in the legged robot are navigation, obstacle avoidance, and path development. This study uses a swarm intelligence based meta-heuristic technique the Modified African Vulture Optimization Algorithm (MAVOA), to address the optimum path planning problem. The developed algorithm imitates the foraging behaviour of vultures. The MAVOA dynamically adjusts the movement of vultures to equate exploration and exploitation. This technique is selected to get the optimum path by avoiding obstacles while navigating a legged robot in an unfamiliar, congested environment. When it comes to the legged robot navigation, the path planning problem is solved by selecting four governing constraints: front-side hurdle length (FHL), left-side hurdle length (LHL), right-side hurdle length (RHL), and the direction of turn (DT) that are considered as the inputs and outputs respectively. The main constraints of earlier researches on existing techniques are impotence to account for motion in new environments, challenges in navigating crowded and complex areas, and the need to optimize intricate pathways. The WEBOT software is chosen for simulating a navigation of a legged robot, and result of simulation is differentiated to experimental outputs configured in a lab setting. Both outcomes show that the legged robot successfully navigated to its objectives while avoiding impediments. After the findings were assessed, it was found that there was less than 5% difference between the output of the simulation and the experiment. The approach can be applied to multiple-purpose or discrete optimization issues and future complicated engineering and science disciplines. Hurdles Legged Robot MAVOA Navigation Simulation WEBOT Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-6004194","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":414730239,"identity":"af3a67d7-fe62-4762-adb0-fbb826e7c274","order_by":0,"name":"Pinaki Das","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAA+ElEQVRIie2RsUrEQBRFbzXbPEw7i5L9hQcBRVjwVyYsThXEcstUm2Y/YD/D0sLihUCq+QCXbUyzNgqxU9jCSRAbcbawsZhTDfPe4d5hgEjkH3JVVQKwJjUp4U/mbLw2AYXJ+fHtPD0hgQgMHVe0YaC3War92rcS4gLm+q7nJl9NX+vm7cESJs0TuvvflcuybrebQTm9MSL7gkCWkbtATF3aHY1KwSKy9MUKIF8FlAbnu8NYzH0pyUtY4dYrYJspTYPii+kjKdM12e2a56kiX8yJJaX3LCElmT23j+8HTbPKZf1SFmmSLLruI/SWHygM/xOJRCKRP/EJaeRXX6rO8BsAAAAASUVORK5CYII=","orcid":"","institution":"National Institute of Technology","correspondingAuthor":true,"prefix":"","firstName":"Pinaki","middleName":"","lastName":"Das","suffix":""},{"id":414730240,"identity":"f1b97649-0c2d-45c6-b7c4-5079227c8c63","order_by":1,"name":"Dayal R. Parhi","email":"","orcid":"","institution":"National Institute of Technology","correspondingAuthor":false,"prefix":"","firstName":"Dayal","middleName":"R.","lastName":"Parhi","suffix":""},{"id":414730241,"identity":"fadb73df-a6bf-4bac-bd6a-4f1022dc57d6","order_by":2,"name":"Abhijit Mahapatro","email":"","orcid":"","institution":"National Institute of Technology","correspondingAuthor":false,"prefix":"","firstName":"Abhijit","middleName":"","lastName":"Mahapatro","suffix":""},{"id":414730242,"identity":"e71298bb-d28b-4e27-b1d8-8a8f2c08fa9f","order_by":3,"name":"Himansu Sekhar Dash","email":"","orcid":"","institution":"Indira Gandhi Institute of Technology","correspondingAuthor":false,"prefix":"","firstName":"Himansu","middleName":"Sekhar","lastName":"Dash","suffix":""},{"id":414730245,"identity":"47416a08-2d39-41b0-b312-a22a00e96e1e","order_by":4,"name":"V. S. Surya Prakash","email":"","orcid":"","institution":"Aditya University","correspondingAuthor":false,"prefix":"","firstName":"V.","middleName":"S. Surya","lastName":"Prakash","suffix":""}],"badges":[],"createdAt":"2025-02-11 06:23:27","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-6004194/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-6004194/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":76313272,"identity":"f665cd4b-cd68-43ed-bf72-624a29243bc2","added_by":"auto","created_at":"2025-02-14 16:08:45","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":731323,"visible":true,"origin":"","legend":"","description":"","filename":"ManuscriptDraftRevised.pdf","url":"https://assets-eu.researchsquare.com/files/rs-6004194/v1_covered_25698203-6cd0-418b-91d4-454c996c6b5a.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Navigational Analysis of Legged Robot using the Modified African Vulture Optimization Algorithm","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Hurdles, Legged Robot, MAVOA, Navigation, Simulation, WEBOT","lastPublishedDoi":"10.21203/rs.3.rs-6004194/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-6004194/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThe main challenges in the legged robot are navigation, obstacle avoidance, and path development. This study uses a swarm intelligence based meta-heuristic technique the Modified African Vulture Optimization Algorithm (MAVOA), to address the optimum path planning problem. The developed algorithm imitates the foraging behaviour of vultures. The MAVOA dynamically adjusts the movement of vultures to equate exploration and exploitation. This technique is selected to get the optimum path by avoiding obstacles while navigating a legged robot in an unfamiliar, congested environment. When it comes to the legged robot navigation, the path planning problem is solved by selecting four governing constraints: front-side hurdle length (FHL), left-side hurdle length (LHL), right-side hurdle length (RHL), and the direction of turn (DT) that are considered as the inputs and outputs respectively. The main constraints of earlier researches on existing techniques are impotence to account for motion in new environments, challenges in navigating crowded and complex areas, and the need to optimize intricate pathways. The WEBOT software is chosen for simulating a navigation of a legged robot, and result of simulation is differentiated to experimental outputs configured in a lab setting. Both outcomes show that the legged robot successfully navigated to its objectives while avoiding impediments. After the findings were assessed, it was found that there was less than 5% difference between the output of the simulation and the experiment. The approach can be applied to multiple-purpose or discrete optimization issues and future complicated engineering and science disciplines.\u003c/p\u003e","manuscriptTitle":"Navigational Analysis of Legged Robot using the Modified African Vulture Optimization Algorithm","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2025-02-14 07:46:30","doi":"10.21203/rs.3.rs-6004194/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"f1c40e7a-dbfd-40e7-a675-4b4515707c57","owner":[],"postedDate":"February 14th, 2025","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2025-02-14T16:08:18+00:00","versionOfRecord":[],"versionCreatedAt":"2025-02-14 07:46:30","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-6004194","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-6004194","identity":"rs-6004194","version":["v1"]},"buildId":"8U1c8b4HqxoKbykW_rLl7","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2025) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00