• Login
    View Item 
    •   DSpace Home
    • ASME
    • Journal of Computing and Information Science in Engineering
    • View Item
    •   DSpace Home
    • ASME
    • Journal of Computing and Information Science in Engineering
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Risk-Bounded and Probabilistic Roadmap-Based Motion Planner for Arbitrarily Shaped Robots With Uncertainty

    Thumbnail
    View/Open
    jcise-24-1471.pdf (984.1Kb)
    Date
    2025
    Author
    Stone, Ronnie F. P.
    Wang, Junmin
    Sha, Zhenghui
    Metadata
    Show full item record
    Abstract
    Motion planning for mobile robots in dynamic and uncertain environments (e.g., in multirobot manufacturing) is challenging due to the stochastic nature of the problem. One common approach is to construct an initial plan to guide the robots, and as information is collected during execution, adjustments are made in real time to account for the impact of uncertainties. This approach, while feasible, leaves the burden of dynamic collision avoidance on controllers, which may not find collision-free and optimal control inputs fast enough. Additionally, the computational burden is exacerbated as the dimensionality of the workspace and the number and geometric complexity of obstacles increase. This article presents a novel probabilistic roadmap (PRM)-based offline motion planner for mobile robots traveling under uncertainty. The planner considers arbitrarily shaped holonomic robots in an environment with multiple static and dynamic obstacles. Since PRM is graph-based, we model the uncertainty by treating edge costs as general probability density functions whose exact profiles are related to the actuation characteristics of a mobile robot. The risk of success (i.e., no collision) per each action in the plan is lower-bounded by a user-defined value, allowing an informed choice between solution safety and quality. Simulations in various scenarios with both static and dynamic obstacles, and configuration spaces of different dimensions, show the effectiveness and flexibility of the planner, including scenarios contemplating prioritized multirobot planning. Finally, we show that, under practical conditions, the proposed planner can provide time-optimal and globally risk-bounded solutions.
    URI
    http://yetl.yabesh.ir/yetl1/handle/yetl/4310879
    Collections
    • Journal of Computing and Information Science in Engineering

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV
     

     

    Browse

    All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    My Account

    LoginRegister

    Statistics

    View Usage Statistics

    DSpace software copyright © 2002-2015  DuraSpace
    Contact Us | Send Feedback
    Theme by 
    @mire NV