This article proposes a novel modeling and path planning framework to tackle a new problem, named road-network persistent surveillance problem (RPSP), in which the occurrence location and probability of the events are unknown. To capture such events, an unmanned ground vehicle (UGV) with certain detection ability must move along the road-network with different monitoring priorities to persistently monitor them. First, we presented an event-oriented modeling method to formulate the new problem. The monitoring effect of the road-network is quantified by uncertainty, which takes the detection ability of the sensor, the detection interval, and the monitoring weight into account. Based on the proposed model, we then designed a heuristic path planning algorithm from a decision-making perspective, which enables a UGV to persistently monitor the viewpoints of the road-network without traversing them. The simulation results and analysis demonstrate the feasibility and superiority of the proposed approach.
27 October 2021 in IEEE Transactions on Industrial Electronics
This article introduces a new persistent surveillance problem, which is to detect events that randomly occurred on a road network by cooperative unmanned ground vehicles (UGVs) with a certain detection ability, where the road network is simplified into weighted viewpoints and path segments. To tackle the road network cooperative persistent surveillance problem, this article seeks to: 1) evaluate the surveillance effect, and 2) plan the trajectories of UGVs to achieve the optimal surveillance effect. First, the nonconfidence level of event occurrence status at the viewpoint, or the uncertainty, which is derived from the detection ability, the monitoring interval, and the weight of viewpoints, is defined as a performance criterion to evaluate the surveillance effect. Then, the new persistent surveillance problem is formulated as a combinatorial optimization problem and proved to be NP-hard. Considering the characteristics of the problem, a heuristic cooperation path planning algorithm with polynomial time complexity is designed to generate noncyclic trajectories. Theoretical analysis and simulation results demonstrate the feasibility of the proposed algorithm on road networks of any topology. By comparing with the existing methods in simulations and outdoor experiments, it demonstrates that the proposed algorithm has the superiority of reducing the uncertainty of the road network and improving the surveillance efficiency in real-world applications.
The light field display technology based on panel light modulation has obvious industrial advantages. However, light field displays still causes discomfort for users in practical applications, due to issues such as angle of view, number of viewpoints, and crosstalk, etc. As a new type of high performance 2D display technology, mini/micro light emitting diode (MLED) has the potential to provide higher quality 3D display effects, but it may also bring new technological challenges. This paper provides a detailed investigation of technical principles and the latest research progress in light field display technology based on panel light modulation, and analyzes the industrial and academic research difficulties, which are brought about by the combination of MLED and naked-eye light field display. This paper is the first to complete a technical review specifically focused on MLED and naked-eye light field display, which is expected to accelerate the technological development and application process of naked-eye light field display based on MLED panels.
This paper addresses the problem of road network cooperative persistent surveillance algorithm suitable for online planning. A diffusion-based reactive cooperative path planing approach (DRCP) is designed. Compared with existing related methods, DRCP uses reactive architecture, probability independent decision strategy, and implicit cooperation technique, which achieve the fast computation, stable result, and accurate response. The characteristics of DRCP is to create a new exclusive cognition model for each unmanned ground vehicle (UGV), which allows each UGV to refer to only one virtual variable to achieve: 1) Global state estimation based on a limited cognition space. 2) Avoidance of local optimum. 3) Global cooperation with coordinators. Theoretical analysis proves that DRCP may quickly plan paths for a UGV group with any sensor models meeting specific conditions. Numerical simulation shows the accuracy and stability of DRCP. The robustness to unstructured disturbances and rapid response demonstrated in outdoor experiment indicate the ability/potential of the approach for online planning.
21 July 2025 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
This article introduces a reactive methodology tailored for a wide range of practical graph-based path planning applications. In these scenarios, a robot with limited sensor capabilities traverses an undirected graph to optimize metrics related to task duration. This article formalizes these challenges as graph-based persistent path planning problems with temporal logical constraints and proposes a comprehensive persistence planning framework. A novel universal algorithm with quadratic time complexity is designed, striking an optimal balance between accuracy and computational efficiency by establishing a new decision space. Theoretical analysis verifies the algorithm’s convergence and generality, especially for patrol, persistent surveillance, and watchman routing tasks. Moreover, the proposed algorithm is evaluated across various simulation scenarios, demonstrating its effectiveness in addressing complex path planning challenges.