Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Jianqiao Yu

dblp:25/2438 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 4Systems, architecture and hardware · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Robot navigation and mapping · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Robotics › Robot navigation and mapping › SLAM
active SLAM
0.312018
Efficient Active SLAM Based on Submap Joining, Graph Topology and Convex Optimization · ICRA 2018
Robotics › Robot navigation and mapping
SLAM
0.312018
Efficient Active SLAM Based on Submap Joining, Graph Topology and Convex Optimization · ICRA 2018
Robotics › Robot navigation and mapping › robot mapping › map management
submap joining
0.312018
Efficient Active SLAM Based on Submap Joining, Graph Topology and Convex Optimization · ICRA 2018
Robotics › Robot navigation and mapping
area coverage
0.112018
Efficient Active SLAM Based on Submap Joining, Graph Topology and Convex Optimization · ICRA 2018

Methods — techniques the papers use, named apart from their topics

sequential quadratic programming · 0.3model predictive control · 0.3convex optimization · 0.3
YearPublicationVenuePosition
2018 Efficient Active SLAM Based on Submap Joining, Graph Topology and Convex Optimization
abstract
The active SLAM problem considered in this paper aims to plan a robot trajectory for simultaneous localization and mapping (SLAM) as well as for an area coverage task with robot pose uncertainty. Based on a model predictive control (MPC) framework, these two problems are solved respectively by different methods. For the uncertainty minimization MPC problem, based on the graphical structure of the 2D feature-based SLAM, a non-convex constrained least-squares problem is presented to approximate the original problem. Then, using variable substitutions, it is further transformed into a convex problem, and then solved by a convex optimization method. For the coverage task considering robot pose uncertainty, it is formulated and solved by the MPC framework and the sequential quadratic programming (SQP) method. In the whole process, considering the computation complexity, we use linear SLAM, which is a submap joining approach, to reduce the time for planning and estimation. Finally, various simulations are presented to validate the effectiveness of the proposed approach.
Yongbo Chen 0001, Shoudong Huang, Robert Fitch, Jianqiao Yu
ICRA4
2017 Three-dimensional unmanned aerial vehicle path planning using modified wolf pack search algorithm
Yongbo Chen 0001, Yuesong Mei, Jianqiao Yu, Xiaolong Su
Neurocomputing3
2016 Modified central force optimization (MCFO) algorithm for 3D UAV path planning
Yongbo Chen 0001, Jianqiao Yu, Yuesong Mei, Xiaolong Su
Neurocomputing2
2007 An Improved Algorithm for Alhusaini's Algorithm in Heterogeneous Distributed Systems
Jianwei Liao 0001, Jianqiao Yu
ICA3PP2
2005 Exponential Stability of Cohen-Grossberg Neural Networks with Delays
Jianqiao Yu
ISNN (1)2