2 August 2024 in International Journal of Control, Automation, and Systems
19 December 2025 in International Journal of Systems Science
25 February 2023 in arXiv
Occupancy mapping has been widely utilized to represent the surroundings for autonomous robots to perform tasks such as navigation and manipulation. While occupancy mapping in 2-D environments has been well-studied, there have been few approaches suitable for 3-D dynamic occupancy mapping which is essential for aerial robots. This paper presents a novel 3-D dynamic occupancy mapping algorithm called DS-K3DOM. We first establish a Bayesian method to sequentially update occupancy maps for a stream of measurements based on the random finite set theory. Then, we approximate it with particles in the Dempster-Shafer domain to enable real-time computation. Moreover, the algorithm applies kernel-based inference with Dirichlet basic belief assignment to enable dense mapping from sparse measurements. The efficacy of the proposed algorithm is demonstrated through simulations and real experiments.
5 January 2026 in International Journal of Aeronautical and Space Sciences
This paper proposes a novel decentralized task assignment algorithm, called constrained task assignment and scheduling via approximate message passing (CTAS-AMP), for solving the constrained task assignment with scheduling (CTAS) problem, where tasks must be assigned to agents while respecting precedence constraints. Existing decentralized methods such as consensus-based bundle algorithm (CBBA) and its variants are limited in handling complex temporal dependencies. To address this, we model CTAS as a maximum a posteriori (MAP) estimation problem within a graphical model that includes agent, task, and constraint nodes. Using max-product belief propagation, we derive four types of messages and propose an iterative algorithm that computes, exchanges, and refines these messages under practical approximations. To satisfy constraints, the proposed method incorporates dedicated conflict resolution and refinement steps. Simulation results show that CTAS-AMP consistently generates feasible solutions that fully satisfy all precedence constraints, and demonstrates strong performance and robustness, particularly in scenarios with high variance in task rewards, compared to existing approaches such as coupled constrained CBBA.