Naiming Qi

ORCID: 0000-0001-5602-3197
Publications
Citations
Views
---
Saved
---
About
Contact & Profiles
Research Areas
  • Robotic Path Planning Algorithms
  • Advanced Image and Video Retrieval Techniques
  • Distributed Control Multi-Agent Systems
  • Robotics and Sensor-Based Localization
  • Face and Expression Recognition
  • Spacecraft Dynamics and Control
  • Image Retrieval and Classification Techniques
  • Remote-Sensing Image Classification
  • Advanced Clustering Algorithms Research
  • Modular Robots and Swarm Intelligence
  • UAV Applications and Optimization
  • Astro and Planetary Science
  • Space Satellite Systems and Control
  • Control and Dynamics of Mobile Robots
  • Vehicle Routing Optimization Methods
  • Optimization and Search Problems
  • Data Management and Algorithms
  • Complex Network Analysis Techniques
  • Remote Sensing and LiDAR Applications
  • Guidance and Control Systems
  • Ultrasound and Cavitation Phenomena
  • Autonomous Vehicle Technology and Safety
  • Reinforcement Learning in Robotics
  • Visual Attention and Saliency Detection
  • Auction Theory and Applications

Harbin Institute of Technology
2013-2025

Heilongjiang Institute of Technology
2013

In object classification, feature combination can usually be used to combine the strength of multiple complementary features and produce better classification results than any single one. While kernel learning (MKL) is a popular approach in it does not always perform well practical applications. On one hand, optimization process MKL involves huge consumption computation memory space. other some cases, found no baseline methods. This observation motivates us investigate underlying mechanism...

10.1109/tnnls.2015.2461552 article EN IEEE Transactions on Neural Networks and Learning Systems 2015-08-25

The electric sail (E-sail), as an emerging propulsion system with infinite specific impulse, is particularly suitable for ultra-long-distance multi-target deep-space exploration missions. If multiple gravity assists are considered during the process, it can effectively improve efficiency of E-sail. This paper proposes a fast optimization algorithm trajectories E-sail, which achieves celestial bodies and solar-system boundaries in one flight, introduces assist to flight speed E-sail process....

10.3390/aerospace12030196 article EN cc-by Aerospace 2025-02-28

A triple‐stage path prediction algorithm is proposed for real‐time mission planning. In every planning horizon, each unmanned aerial vehicle (UAV) utilises the A* first to estimate task. Then, estimated result serve as input of cluster method generate quasi‐optimal task assignment. The shortest assigned further calculated using algorithm. Finally, it smoothed obtain flyable reference guide UAV by cubic B‐spline curve. Numerical experiments demonstrate effectiveness and efficiency

10.1049/el.2015.1244 article EN Electronics Letters 2015-09-01

To maximize the advantages of being low-cost, highly mobile, and having a high flexibility, aerial recovery technology is important for unmanned vehicle (UAV) swarms. In particular, operation mode “launch-recovery-relaunch” will greatly improve efficiency UAV swarm. However, it difficult to realize large-scale swarms because this process involves complex multi-UAV scheduling, path planning, rendezvous, acquisition problems. study, problem swarm by mother aircraft has been investigated. solve...

10.3390/app10124154 article EN cc-by Applied Sciences 2020-06-17

In the dynamical environment with forbidden areas, achievement of multiple unmanned aerial vehicles (UAVs) executing cooperative missions strongly depends on validity mission planning results, which may be affected by error flight time estimation. this paper, a hierarchical path generation scheme for improving adaptability and performance distributed (DMP) system UAVs is proposed. The effectiveness market-based task allocation enhanced conducting rough beforehand, where only neighboring...

10.1109/cdc.2016.7798507 article EN 2016-12-01

The ability to deploy multiple unmanned aerial vehicles expands their application range, but recovery of presents many unique challenges owing the number and limited time. In this paper, scheduling by one mothership is posed as a combinatorial optimization problem. A mathematical model with time windows developed formulate Furthermore, genetic algorithm proposed for finding optimal sequence. adopts path representation chromosomes simplify encoding process operations. It also resolves...

10.1177/0954410019842487 article EN Proceedings of the Institution of Mechanical Engineers Part G Journal of Aerospace Engineering 2019-04-15

Dominant sets clustering is a promising approach based on graph-theoretic concept of cluster. With the pairwise similarity matrix data as input, dominant determines number clusters by itself and possesses some other nice properties. However, original algorithm sensitive to measures, appropriate parameters are required generate satisfactory results. In order solve this problem, we firstly use histogram equalization transform remove sensitiveness parameters. second step extend merging DBSCAN....

10.1109/icip.2014.7025897 article EN 2022 IEEE International Conference on Image Processing (ICIP) 2014-10-01

In this paper, the traditional shortest path planning problem for vehicle is advanced to length-targeted problem, i.e., plan with its length being as close a specified value possible. Lengthening and shortening of given initial paths are used solve problem. Based on an operation set consisting three basic homotopies, we build comprehensive systematic framework target length, which generalization existing related studies. Thereby, expected can be independently searched through such...

10.1109/tase.2019.2916855 article EN IEEE Transactions on Automation Science and Engineering 2019-06-04

The fuel carried by deep space exploration spacecraft is crucial for the completion of their missions, and attitude control engines even more precious. In order to reduce requirements systems, this paper proposes a shape-based trajectory optimization algorithm that considers constraints low-thrust spacecraft. This method obtains accurate transfer considering change rate range propulsion acceleration direction By comparing simulation results without constraints, it confirmed proposed very...

10.1038/s41598-024-70830-8 article EN cc-by-nc-nd Scientific Reports 2024-08-30

This letter investigates a special task allocation problem with constraints of path planning. The planning process involved is defined as the follow-up step allocation. coupled constraints, which will affect utility solution. A homotopic approach featuring two homotopy primitives proposed to resolve complexity caused by coupling between and Reference paths generated are transformed desired bundles for robots via transformation functions. distributed architecture market mechanism employed...

10.1109/lra.2019.2944060 article EN IEEE Robotics and Automation Letters 2019-09-27

Although there is no shortage of clustering algorithms, existing algorithms are often afflicted by problems one kind or another. Dominant sets a graph‐theoretic approach to and exhibits significant potential in various applications. However, the authors' work indicates that this suffers from two major problems, namely over‐segmentation tendency sensitiveness distance measures. In order overcome these authors present density‐based enhancement dominant where cluster merging step used fuse...

10.1049/iet-cvi.2013.0072 article EN IET Computer Vision 2013-09-06

In this paper, we focus on coordinated motion planning of dual-arm robot. The kinematics model the robotic arm is established by Denavit-Hartenberg (D-H) coordinate method and mathematical cooperative problem established. rapidly-exploring random trees (RRT) algorithm deep deterministic policy gradient (DDPG) are used to carry out planning, respectively. simulation results show that these algorithms can effectively complete robot task, but RRT improved cannot balance efficiency result...

10.1109/icus48101.2019.8996069 article EN 2021 IEEE International Conference on Unmanned Systems (ICUS) 2019-10-01

This paper presents an application of Boolean networks-based auction algorithm (BNAA) for task assignment in unmanned aerial vehicles (UAVs) systems. Under reasonable assumptions, the framework consists mission control system, communication network, and ground station. As improved consensus-based bundle (CBBA), BNAA utilizes a cluster-based combinatorial policy to handle multiple tasks. Instead empirical method based on look-up table about conditional variables, network is introduced into...

10.1155/2015/425356 article EN Mathematical Problems in Engineering 2015-01-01

10.1007/s10044-014-0366-x article EN Pattern Analysis and Applications 2014-02-10

This article addresses the trajectory consensus problem of coordinating trajectories vehicles at multiple future time points. The objective is geometry vehicles' planned trajectories. geometric feature parameterized by a set states defined as required lengths along to reduce distance its ending point specific values. To solve this special involving coupled state variables, conventional model extended attaching it mapping from variables trajectory's geometry. established using homotopic...

10.1109/tcyb.2020.3036289 article EN IEEE Transactions on Cybernetics 2020-12-14

Aerial recovery technology for aircrafts plays a significant role in practical applications, which presents challenging problem cooperative trajectory planning. To solve the problem, hierarchical planning architecture is proposed this paper. Firstly, waypoints of mother aircraft are obtained based on distribution child by using clustering algorithm. A greedy algorithm used to obtain traverse sequence and generated Dubins path. Secondly, genetic employed optimize position time each aircraft....

10.1109/icus50048.2020.9274844 article EN 2020 3rd International Conference on Unmanned Systems (ICUS) 2020-11-27
Coming Soon ...