SearcharxivSearch

arXiv subjects

Dongkun Han

Publications and source records attributed to Dongkun Han.

14 recordsLinked to original sources

VORL-EXPLORE: A Hybrid Learning Planning Approach to Multi-Robot Exploration in Dynamic Environments

Hierarchical multi-robot exploration commonly decouples frontier allocation from local navigation, which can make the system brittle in dense and dynamic environments. Because the allocator lacks direct awareness of execution difficulty, robots may cluster at bottlenecks, trigger oscillatory replanning, and generate redundant coverage. We propose VORL-EXPLORE, a hybrid learning and planning framework that addresses this limitation through execution fidelity, a shared estimate of local navigability that couples task allocation with motion execution. This fidelity signal is incorporated into a fidelity-coupled Voronoi objective with inter-robot repulsion to reduce contention before it emerges. It also drives a risk-aware adaptive arbitration mechanism between global A* guidance and a reactive reinforcement learning policy, balancing long-range efficiency with safe interaction in confined spaces. The framework further supports online self-supervised recalibration of the fidelity model using pseudo-labels derived from recent progress and safety outcomes, enabling adaptation to non-stationary obstacles without manual risk tuning. We evaluate this capability separately in a dedicated severe-traffic ablation. Extensive experiments in randomized grids and a Gazebo factory scenario show high success rates, shorter path length, lower overlap, and robust collision avoidance. The source code will be made publicly available upon acceptance.

cs.RO

Development of a New Type of Vortex Bladeless Wind Turbine for Urban Energy Systems

Innovation and development of renewable energy devices are crucial for reaching a sustainable and environmentally conscious future. This work focuses on the development of a new type of renewable energy devices in the context of Smart Garden at the Chinese University of Hong Kong, which aims to design a bladeless wind turbine for urban areas, addressing the pressing need for clean energy locally and globally. Traditional wind turbines have been widely adopted in recent decades, while bladeless wind turbines have also displayed their advantages and uniqueness in urban areas. A Vortex Bladeless Wind Turbine (VBWT) is modeled by using Fusion 360 to optimize wind energy generation in urban settings with limited space and buildings-dominated landscape. Optimal parameters of the VBWT were obtained by comparing the results of drag force, lift force and deflection, via the simulations in Ansys. Hardware of proposed bladeless wind turbine has been assembled and developed by 3-dimensional printing. Additional tests and adjustments on hardware further improve the performance of the developed wind turbine. The outcomes of this work have the potential to contribute to future renewable energy initiatives and devote the sustainability efforts in urban energy systems.

cs.CE

Automatic Navigation and Voice Cloning Technology Deployment on a Humanoid Robot

Mobile robots have shown immense potential and are expected to be widely used in the service industry. The importance of automatic navigation and voice cloning cannot be overstated as they enable functional robots to provide high-quality services. The objective of this work is to develop a control algorithm for the automatic navigation of a humanoid mobile robot called Cruzr, which is a service robot manufactured by Ubtech. Initially, a virtual environment is constructed in the simulation software Gazebo using Simultaneous Localization And Mapping (SLAM), and global path planning is carried out by means of local path tracking. The two-wheel differential chassis kinematics model is employed to ensure autonomous dynamic obstacle avoidance for the robot chassis. Furthermore, the mapping and trajectory generation algorithms developed in the simulation environment are successfully implemented on the real robot Cruzr. The performance of automatic navigation is compared between the Dynamic Window Approach (DWA) and Model Predictive Control (MPC) algorithms. Additionally, a mobile application for voice cloning is created based on a Hidden Markov Model, and the proposed Chatbot is also tested and deployed on Cruzr.

cs.RO

Distributed Coordination for Multi-Vehicle Systems in the Presence of Misbehaving Vehicles

The coordination problem of multi-vehicle systems is of great interests in the area of autonomous driving and multi-vehicle control. This work mainly focuses on multi-task coordination problem of a group of vehicles with a bicycle model and some specific control objectives, including collision avoidance, connectivity maintenance and convergence to desired destinations. The basic idea is to develop a proper Lyapunov-like barrier function for all tasks and a distributed controller could be built in the presence of misbehaving vehicles. Control protocols are provided for both leader vehicle and follower vehicles. The simulation results demonstrate the effectiveness of proposed method.

eess.SY

Optimal Real-time Bidding Strategy For EV Aggregators in Wholesale Electricity Markets

With the rapid growth of electric vehicles (EVs), EV aggregators have been playing a increasingly vital role in power systems by not merely providing charging management but also participating in wholesale electricity markets. This work studies the optimal real-time bidding strategy for an EV aggregator. Since the charging process of EVs is time-coupled, it is necessary for EV aggregators to consider future operational conditions (e.g., future EV arrivals) when deciding the current bidding strategy. However, accurately forecasting future operational conditions is challenging under the inherent uncertainties. Hence, there demands a real-time bidding strategy based solely on the up-to-date information, which is the main goal of this work. We start by developing an online optimal EV charging management algorithm for the EV aggregator via Lyapunov optimization. Based on this, an optimal real-time bidding strategy (bidding cost curve and bounds) for the aggregator is derived. Then, an efficient yet practical algorithm is proposed to obtain the bidding strategy. It shows that with the proposed bidding strategy, the aggregator's profit is nearly offline optimal. Moreover, the wholesale electricity market clearing result aligns with the individual aggregator's optimal charging strategy given the prices. Case studies against several benchmarks are conducted to evaluate the performance of the proposed method.

math.OC

Finite-time Motion Planning of Multi-agent Systems with Collision Avoidance

Finite-time motion planning with collision avoidance is a challenging issue in multi-agent systems. This paper proposes a novel distributed controller based on a new Lyapunov barrier function which guarantees finite-time stability for multi-agent systems without collisions. First, the problem of finite-time motion planning of multi-agent systems is formulated. Then, a novel finite-time distributed controller is developed based on a Lyapunov barrier function. Finally, numerical simulations demonstrate the effectiveness of proposed method.

cs.MA

Barrier Certified Safety Learning Control: When Sum-of-Square Programming Meets Reinforcement Learning

Safety guarantee is essential in many engineering implementations. Reinforcement learning provides a useful way to strengthen safety. However, reinforcement learning algorithms cannot completely guarantee safety over realistic operations. To address this issue, this work adopts control barrier functions over reinforcement learning, and proposes a compensated algorithm to completely maintain safety. Specifically, a sum-of-squares programming has been exploited to search for the optimal controller, and tune the learning hyperparameters simultaneously. Thus, the control actions are pledged to be always within the safe region. The effectiveness of proposed method is demonstrated via an inverted pendulum model. Compared to quadratic programming based reinforcement learning methods, our sum-of-squares programming based reinforcement learning has shown its superiority.

eess.SY

Sum-of-Squares Program and Safe Learning On Maximizing the Region of Attraction of Partially Unknown Systems

Recent advances in learning techniques have enabled the modelling of unknown dynamical systems directly from data. However, in many contexts, these learning-based methods are short of safety guarantee and strict stability verification. To address this issue, this paper first approximates the partially unknown nonlinear systems by using a learned state space with Gaussian Processes and Chebyshev interpolants. A Sum-of-Squares Programming based approach is then proposed to synthesize a controller by searching an optimal control Lyapunov Barrier function. In this way, we maximize the estimated region of attraction of partially unknown nonlinear systems, while guaranteeing both safety and stability. It is shown that the proposed method improves the extrapolation performance, and at the same time, generates a significantly larger estimated region of attraction.

eess.SY

On Estimating the Probabilistic Region of Attraction for Partially Unknown Nonlinear Systems: An Sum-of-Squares Approach

Estimating the region of attraction for partially unknown nonlinear systems is a challenging issue. In this paper, we propose a tractable method to generate an estimated region of attraction with probability bounds, by searching an optimal polynomial barrier function. Chebyshev interpolants, Gaussian processes and sum-of-squares programmings are used in this paper. To approximate the unknown non-polynomial dynamics, a polynomial mean function of Gaussian processes model is computed to represent the exact dynamics based on the Chebyshev interpolants. Furthermore, probabilistic conditions are given such that all the estimates are located in certain probability bounds. Numerical examples are provided to demonstrate the effectiveness of the proposed method.

eess.SY

Permissive Barrier Certificates for Safe Stabilization Using Sum-of-squares

Motivated by the need to simultaneously guarantee safety and stability of safety-critical dynamical systems, we construct permissive barrier certificates in this paper that explicitly maximize the region where the system can be stabilized without violating safety constraints. An optimization strategy is developed to search for the maximum volume barrier certified region of safe stabilization. The barrier certified region, which is allowed to take any arbitrary shape, is proved to be strictly larger than safe regions generated with Lyapunov sublevel set based methods. The proposed approach effectively unites a Lyapunov function with multiple barrier functions that might not be compatible with each other. Iterative search algorithms are developed using sum-of-squares to compute the most permissive, that is, the maximum volume, barrier certificates. Simulation results of the iterative search algorithm demonstrate the effectiveness of the proposed method.

math.OC

Approximating the Region of Multi-Task Coordination via the Optimal Lyapunov-Like Barrier Function

We consider the multi-task coordination problem for multi-agent systems under the following objectives: 1. collision avoidance; 2. connectivity maintenance; 3. convergence to desired destinations. The paper focuses on the safety guaranteed region of multi-task coordination (SG-RMTC), i.e., the set of initial states from which all trajectories converge to the desired configuration, while at the same time achieve the multi-task coordination and avoid unsafe sets. In contrast to estimating the domain of attraction via Lyapunov functions, the main underlying idea is to employ the sublevel sets of Lyapunov-like barrier functions to approximate the SG-RMTC. Rather than using fixed Lyapunov-like barrier functions, a systematic way is proposed to search an optimal Lyapunov-like barrier function such that the under-estimate of SG-RMTC is maximized. Numerical examples illustrate the effectiveness of the proposed method.

eess.SY

Chebyshev Approximation and Higher Order Derivatives of Lyapunov Functions for Estimating the Domain of Attraction

Estimating the Domain of Attraction (DA) of non-polynomial systems is a challenging problem. Taylor expansion is widely adopted for transforming a nonlinear analytic function into a polynomial function, but the performance of Taylor expansion is not always satisfactory. This paper provides solvable ways for estimating the DA via Chebyshev approximation. Firstly, for Chebyshev approximation without the remainder, higher order derivatives of Lyapunov functions are used for estimating the DA, and the largest estimate is obtained by solving a generalized eigenvalue problem. Moreover, for Chebyshev approximation with the remainder, an uncertain polynomial system is reformulated, and a condition is proposed for ensuring the convergence to the largest estimate with a selected Lyapunov function. Numerical examples demonstrate that both accuracy and efficiency are improved compared to Taylor approximation.

eess.SY

Robust Semi-Cooperative Multi-Agent Coordination in the Presence of Stochastic Disturbances

This paper presents a robust distributed coordination protocol that achieves generation of collision-free trajectories for multiple unicycle agents in the presence of stochastic uncertainties. We build upon our earlier work on semi-cooperative coordination and we redesign the coordination controllers so that the agents counteract a class of state (wind) disturbances and measurement noise. Safety and convergence is proved analytically, while simulation results demonstrate the efficacy of the proposed solution.

eess.SY

Distributed Multi-task Formation Control under Parametric Communication Uncertainties

Formation control is a key problem in the coordination of multiple agents. It arises new challenges to traditional formation control strategy when the communication among agents is affected by uncertainties. This paper considers the robust multi-task formation control problem of multiple non-point agents whose communications are disturbed by uncertain parameters. The control objectives include 1. achieving the desired configuration; 2. avoiding collisions; 3. preserving the connectedness of uncertain topology. To achieve these objectives, firstly, a condition of Linear Matrix Inequalities (LMIs) is proposed for checking the connectedness of an uncertain communication topology. Then, by preserving the initial topological connectedness, a gradient-based distributed controller is designed via Lyapunov-like barrier functions. Two numerical examples illustrate the effectiveness of the proposed method.

eess.SY