SPIN-Based Linear Temporal Logic Path Planning for Ground Vehicle Missions with Motion Constraints on Digital Elevation Models

Linear temporal logic (LTL) formalism can ensure the correctness of mobile robot planning through concise, readable, and verifiable mission specifications. For uneven terrain, planning must consider motion constraints related to asymmetric slope traversability and maneuverability. However, even though model checker tools like the open-source Simple Promela Interpreter (SPIN) include search optimization techniques to address the state explosion problem, defining a global LTL property that encompasses both mission specifications and motion constraints on digital elevation models (DEMs) can lead to complex models and high computation times. In this article, we propose a system model that incorporates a set of uncrewed ground vehicle (UGV) motion constraints, allowing these constraints to be omitted from LTL model checking. This model is used in the LTL synthesizer for path planning, where an LTL property describes only the mission specification. Furthermore, we present a specific parameterization for path planning synthesis using a SPIN. We also offer two SPIN-efficient general LTL formulas for representative UGV missions to reach a DEM partition set, with a specified or unspecified order, respectively. Validation experiments performed on synthetic and real-world DEMs demonstrate the feasibility of the framework for complex mission specifications on DEMs, achieving a significant reduction in computation cost compared to a baseline approach that includes a global LTL property, even when applying appropriate search optimization techniques on both path planners.

Modeling of slip rate-dependent traversability for path planning of wheeled mobile robot in sandy terrain

A planetary exploration rover has been employed for scientific endeavors or as a precursor for upcoming manned missions. Predicting rover traversability from its wheel slip ensures safe and efficient autonomous operations of rovers on deformable planetary surfaces; path planning algorithms that reduce slips by considering wheel-soil interaction or terrain data can minimize the risk of the rover becoming immobilized. Understanding wheel-soil interaction in transient states is vital for developing a more precise slip ratio prediction model, while path planning in the past assumes that slips generated at the path is a series of slip ratio in steady state. In this paper, we focus on the transient slip, or slip rate the time derivative of slip ratio, to explicitly address it into the cost function of path planning algorithm. We elaborated a regression model that takes slip rate and traction force as inputs and outputs slip ratio, which is employed in the cost function to minimize the rover slip in path planning phase. Experiments using a single wheel testbed revealed that even with the same wheel traction force, the slip ratio varies with different slip rates; we confirmed that the smaller the absolute value of the slip rate, the larger the slip ratio for the same traction force. The statistical analysis of the regression model confirms that the model can estimate the slip ratio within an accuracy of 85% in average. The path planning simulation with the regression model confirmed a reduction of 58% slip experienced by the rover when driving through rough terrain environments. The dynamics simulation results insisted that the proposed method can reduce the slip rate in rough terrain environments.

Fast Route Planner Considering Terrain Information

Route planning considering terrain information is useful for the navigation of autonomous ground vehicles (AGV) on complicated terrain surfaces, such as mountains with rivers. For instance, an AGV in mountains cannot cross a river or a valley that is too steep. This article addresses a novel route-planning algorithm that is time-efficient in building a sub-optimal route considering terrain information. In order to construct a route from the start to the end point in a time-efficient manner, we simulate two virtual vehicles that deploy virtual nodes iteratively, such that the connected node network can be formed. The generated node network serves as a topological map for a real AGV, and we construct the shortest route from the start to the end point utilizing the network. The route is weighted considering the route length, the steepness of the route, and the traversibility of the route. Through MATLAB simulations, we demonstrate the effectiveness of the proposed route-planning algorithm by comparing it with RRT-star planners.

Fast Multi-UAV Path Planning for Optimal Area Coverage in Aerial Sensing Applications

This paper deals with the problems and the solutions of fast coverage path planning (CPP) for multiple UAVs. Through this research, the problem is solved and analyzed with both a software framework and algorithm. The implemented algorithm generates a back-and-forth path based on the onboard sensor footprint. In addition, three methods are proposed for the individual path assignment: simple bin packing trajectory planner (SIMPLE-BINPAT); bin packing trajectory planner (BINPAT); and Powell optimized bin packing trajectory planner (POWELL-BINPAT). The three methods use heuristic algorithms, linear sum assignment, and minimization techniques to optimize the planning task. Furthermore, this approach is implemented with applicable software to be easily used by first responders such as police and firefighters. In addition, simulation and real-world experiments were performed using UAVs with RGB and thermal cameras. The results show that POWELL-BINPAT generates optimal UAV paths to complete the entire mission in minimum time. Furthermore, the computation time for the trajectory generation task decreases compared to other techniques in the literature. This research is part of a real project funded by the H2020 FASTER Project, with grant ID: 833507.