Time resource management of OAR based on fuzzy logic priority for multiple target tracking

For coping with the multiple target tracking in the presence of complex time-varying environments and unknown target information, a time resource management scheme based on chance-constraint programming（CCP） employing fuzzy logic priority is proposed for opportunistic array radar（OAR）. In this scheme,the total beam illuminating time is minimized by effective time resource allocation so that the desired tracking performance is achieved. Meanwhile, owing to the randomness of radar cross section（RCS）, the CCP is used to balance tracking accuracy and time resource conditioned on the specified confidence level. The adaptive fuzzy logic prioritization, imitating the human decision-making process for ranking radar targets, can realize the full potential of radar. The Bayesian Crame ′r-Rao lower bound（BCRLB） provides us with a low bound of localization estimation root-mean-square error（RMSE）, and equally important, it can be calculated predictively. Consequently, it is employed as an optimization criterion for the time resource allocation scheme. The stochastic simulation is integrated into the genetic algorithm（GA） to compose a hybrid intelligent optimization algorithm to solve the CCP optimization problem. The simulation results show that the time resource is saved strikingly and the radar performance is also improved.

Time-space Viewpoint Planning for Guard Robot with Chance Constraint

This paper presents a novel movement planning algorithm for a guard robot in an indoor environment, imitating the job of human security. A movement planner is employed by the guard robot to continuously observe a certain person. This problem can be distinguished from the person following problem which continuously follows the object. Instead, the movement planner aims to reduce the movement and the energy while keeping the target person under its visibility. The proposed algorithm exploits the topological features of the environment to obtain a set of viewpoint candidates, and it is then optimized by a cost-based set covering problem. Both the robot and the target person are modeled using geodesic motion model which considers the environment shape. Subsequently, a particle model-based planner is employed, considering the chance constraints over the robot visibility, to choose an optimal action for the robot. Simulation results using 3D simulator and experiments on a real environment are provided to show the feasibility and effectiveness of our algorithm.