CHChenlong He

Chenlong He

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Chenlong He has a total of 6 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    A flocking algorithm for multi-agent systems with connectivity preservation under hybrid metric-topological interactions

    by Chenlong He, Zuren Feng, Zhigang Ren

    In this paper, we propose a connectivity-preserving flocking algorithm for multi-agent systems in which the neighbor set of each agent is determined by the hybrid metric-topological distance so that the interaction topology can be represented as the range-limited Delaunay graph, which combines the properties of the commonly used disk graph and Delaunay graph. As a result, the proposed flocking algorithm has the following advantages over the existing ones. First, range-limited Delaunay graph is sparser than the disk graph so that the information exchange among agents is reduced significantly. Second, some links irrelevant to the connectivity can be dynamically deleted during the evolution of the system. Thus, the proposed flocking algorithm is more flexible than existing algorithms, where links are not allowed to be disconnected once they are created. Finally, the multi-agent system spontaneously generates a regular quasi-lattice formation without imposing the constraint on the ratio of the sensing range of the agent to the desired distance between two adjacent agents. With the interaction topology induced by the hybrid distance, the proposed flocking algorithm can still be implemented in a distributed manner. We prove that the proposed flocking algorithm can steer the multi-agent system to a stable flocking motion, provided the initial interaction topology of multi-agent systems is connected and the hysteresis in link addition is smaller than a derived upper bound. The correctness and effectiveness of the proposed algorithm are verified by extensive numerical simulations, where the flocking algorithms based on the disk and Delaunay graph are compared.


  • Open Access

    Distributed Algorithm for Voronoi Partition of Wireless Sensor Networks with a Limited Sensing Range

    by Chenlong He, Zuren Feng, Zhigang Ren

    For Wireless Sensor Networks (WSNs), the Voronoi partition of a region is a challenging problem owing to the limited sensing ability of each sensor and the distributed organization of the network. In this paper, an algorithm is proposed for each sensor having a limited sensing range to compute its limited Voronoi cell autonomously, so that the limited Voronoi partition of the entire WSN is generated in a distributed manner. Inspired by Graham’s Scan (GS) algorithm used to compute the convex hull of a point set, the limited Voronoi cell of each sensor is obtained by sequentially scanning two consecutive bisectors between the sensor and its neighbors. The proposed algorithm called the Boundary Scan (BS) algorithm has a lower computational complexity than the existing Range-Constrained Voronoi Cell (RCVC) algorithm and reaches the lower bound of the computational complexity of the algorithms used to solve the problem of this kind. Moreover, it also improves the time efficiency of a key step in the Adjust-Sensing-Radius (ASR) algorithm used to compute the exact Voronoi cell. Extensive numerical simulations are performed to demonstrate the correctness and effectiveness of the BS algorithm. The distributed realization of the BS combined with a localization algorithm in WSNs is used to justify the WSN nature of the proposed algorithm.


  • Collective motion of self-propelled particles without collision and fragmentation

    by Chenlong He, Zuren Feng, Zhigang Ren

    In this paper, we propose a novel model to generate collective motion of self-propelled particles without collision and fragmentation by means of adjusting the absolute velocity instead of the constant speed used in the original Vicsek model. Interactions among particles are represented by the r-limited Delaunay graph to guarantee the locality of the model. The centroid of the Voronoi cell is set as a destination to scatter particles. The formation of the group is controlled by the surface tension generated by particles on the boundary. Without noise and periodic boundary, given a collision-free and cohesive configuration initially, the abundant types of collective motion will emerge from the local behaviors. Numerical simulations demonstrate that our model can produce rich behaviors such as crystallization, rotation, flocking and cluster with different combinations of two coefficients adjusting the amplitude of centering force and surface tension, respectively. Collisions among particles and fragmentations of the group do not appear.