3 January 2020 in IEEE Robotics and Automation Letters
12 July 2021 in IEEE Access
MJMohamed Khalid M. Jaffar
+2
Metareasoning refers to reasoning about one’s own decision making process. This paper considers metareasoning about the decision making process in multi-agent settings. We present a multi-agent metareasoning approach that enables a multi-agent team to select which task allocation algorithm to use as a function of changing communication quality level. Given a set of multi-agent task allocation algorithms, we synthesize a policy that prescribes the best algorithm to use among a predefined set of algorithms for a given communication level. Since each agent in the team runs the same policy, the team (or a part of the team) will collectively switch between task allocation algorithms as a function of the observed level of communication. We apply reactive synthesis to generate the policy from high-level specifications written in Linear Temporal Logic encoding the agents’ switching behavior with respect to the state of the environment. We perform experiments in simulation to identify the best performing algorithms under different communication levels. The communication environment is modeled using the Rayleigh fading model and communication estimation is done through the exchange of heartbeat messages among agents. We test our metareasoning policy in three types of scenarios: search & rescue, fire monitoring, and ship protection scenarios. For each scenario, we demonstrate that our policy achieved better performance with respect to either max distance traveled, max number of transmitted messages or both compared to running any single algorithm.
8 July 2022 in IEEE Transactions on Robotics
Bidirectional path and motion planning approaches decrease planning time, on average, compared to their unidirectional counterparts. In single-query feasible motion planning, using bidirectional search to find a continuous motion plan requires an edge connection between the forward search tree and the reverse search tree. Such a tree–tree connection requires solving a two-point boundary value problem (BVP). However, obtaining a closed-form two-point BVP solution can be difficult or impossible for many systems. While numerical methods can provide a reasonable solution in many cases, they are often computationally expensive, numerically unstable, or sensitive (to an initial guess) for the purposes of single-query sampling-based motion planning. To overcome this challenge, we present a novel bidirectional search strategy that does not require solving the two-point BVP. Instead of connecting the forward and reverse trees directly, the reverse tree's cost information is used as a guiding heuristic for forward search. This enables the forward search to quickly grow down the reverse tree—converging to a fully feasible solution without a direct tree–tree connection and without the solution to a two-point BVP. In this article, we propose two algorithms that use this strategy for single-query feasible motion planning for various dynamical systems, performing experiments in both simulation and hardware testbeds. We find that these algorithms perform better than or comparable to the existing state-of-the-art methods with respect to quickly finding an initial feasible solution.
8 March 2023 in IEEE Robotics and Automation Letters
We present a heuristic-guided multi-robot motion planning framework that solves the problem of n dynamical agents visiting m unlabeled targets in a partially known environment for planetary surface missions without solving the two-point boundary value problem (BVP). The framework design is motivated by typical planetary surface mission constraints of limited power, limited computation, and limited communication. The framework maintains a centralized, dynamically updated probabilistic roadmap (PRM) that incorporates new obstacle updates as the agents move in the environment. The dynamic roadmap captures the changing obstacle topology and provides updated cost-to-go heuristics to accelerate each agent's independent single-query motion-planning process. The agents use a feasible sampling-based motion planner without computing the BVP while leveraging the roadmap heuristics to quickly plan and visit their assigned target. The agents handle robot-robot and robot-obstacle collision avoidance in a decentralized fashion. We conduct multiple simulation experiments using robots with non-linear dynamics to show our planner performs better in overall planning time and mission time than approaches not using the roadmap heuristic. We also field our algorithm on prototype rovers and demonstrate the viability of implementing our algorithm on real-world hardware platforms.
23 September 2022 in arXiv
Bidirectional motion planning approaches decrease planning time, on average, compared to their unidirectional counterparts. In single-query feasible motion planning, using bidirectional search to find a continuous motion plan requires an edge connection between the forward and reverse search trees. Such a tree-tree connection requires solving a two-point Boundary Value Problem (BVP). However, a two-point BVP solution can be difficult or impossible to calculate for many systems. We present a novel bidirectional search strategy that does not require solving the two-point BVP. Instead of connecting the forward and reverse trees directly, the reverse tree's cost information is used as a guiding heuristic for the forward search. This enables the forward search to quickly converge to a feasible solution without solving the two-point BVP. We propose two new algorithms (GBRRT and GABRRT) that use this strategy and run multiple software simulations using multiple dynamical systems and real-world hardware experiments to show that our algorithms perform on-par or better than existing state-of-the-art methods in quickly finding an initial feasible solution.