Article · 29 Sep 2025
Research articlePublished 2015
A Robotic Path Planner Contender
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
This article presents a novel offline path planner method to yield a collision-free trajectory among groups of obstacles in a static workspace. It enables a single holonomic point robot acting in a static environment including a fixed initial and goal configurations to achieve its goal toward a collision-free trajectory. In developing our novel path planner, we focused to elevate features that help the planner to route in a wide variety of different situations in regards to lowering the processing time needed for analyzing the workspace and determination of ultimate trajectory. Unlike to some other planners that are able to be applied on some certain obstacle shales such as polygonal, our planner is skillful enough to analyze any types of obstacles, such as circular, spiral, and curved edged obstacles successfully. To increase the performance of our proposed offline path planner, we defined and benefitted from introduction of parameters that help to achieve the best possible results among different scenarios in workspace components arrangements as well as reducing the planner needing to access system resources such as memory or processing unit to analyze the workspace while computing the shortest collision-free path from start point to the goal configuration. The novel planner analyses and transforms the two dimensional representation of the environment into a roadmap consisting a graph of nodes along with all possible routes from the moving robot’s initial point into the goal configuration. In order to manage some of the popular problems such as being trapped inside a U-shaped obstacle or routing in narrow pathways among obstacles, that challenge other offline path planners such as Potential Field planner are facing, we used a multi-layer approach in form of different stages to help the planner considering all possible circumstances and hence, compute the best possible route.
Subjects
Computer Science & ITAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Conference abstract · 28 Jun 2017
Survey on prioritized multi robot path planning
Research article · 2017
Full Covered Path Planning Algorithm for Portable Back Massage Robot
Mini review · 28 Aug 2023
Autonomous Robots: Navigating the Path to Self-sufficiency
Research article · 2021
Design and Development of Path Following Robot with Spray Painting
More from this journal
The newest in Advances in Robotics & Automation.
Article · 29 Dec 2025
Cloud Robotics: Evolution, Capabilities, Challenges
Article · 29 Dec 2025
Advancing Multi-Robot Collaboration and Resilience
Article · 29 Dec 2025
Simulation: The Cornerstone of Robotics Advancement
Conferences in this field
Upcoming conferences in this field.
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalAdvances in Robotics & Automation
- SubjectComputer Science & IT
- BylineArticles whose byline prints “Kamkarian P”
- BylineArticles whose byline prints “Hexmoor H”

