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

Mingli Wang 0006

dblp:262/8884 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
0000-0001-8376-808XORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 1 · 1 first-author · 1 since 2021

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
Motion planning and robot control · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control
motion planning
0.612022
A Third-Order Constrained Approximate Time-Optimal Feedrate Planning Algorithm · IEEE Trans. Robotics 2022
Robotics › Motion planning and robot control
robot control
0.612022
A Third-Order Constrained Approximate Time-Optimal Feedrate Planning Algorithm · IEEE Trans. Robotics 2022
Robotics › Motion planning and robot control › motion planning
trajectory smoothing
0.612022
A Third-Order Constrained Approximate Time-Optimal Feedrate Planning Algorithm · IEEE Trans. Robotics 2022

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

third-order constraints · 0.6speed curve smoothing · 0.6bidirectional scanning · 0.6
YearPublicationVenuePosition
2022 A Third-Order Constrained Approximate Time-Optimal Feedrate Planning Algorithm
abstract
Robot end-effector tracking of a specific spatial path to fulfill certain requirements is a topic of great interest. First, considering both dynamic constraints and kinematic constraints, the planned velocity has characteristics of bounded high-order derivatives to ensure smooth motion. Second, to meet high-efficiency requirements, the feedrate of the end-effector should be planned within the best possible time. Although some studies have shown that they obtained the time-optimal solution by considering the second-order constraints, this is still an open problem for third-order constraints. Therefore, this article proposes an approximate time-optimal feedrate (ATOF) planning algorithm that considers third-order constraints. This algorithm is primarily based on the bidirectional scanning method, which includes two steps. First, we calculate the second-order time-optimal velocity (TOV2) curve under the third-order maximum velocity curve. Then, considering TOV2, we propose an ATOF algorithm that includes single-direction speed planning and speed curve smoothing. It is more practical for not only considering the Coulomb viscous friction and torque rate but also avoiding difficult calculations at the singular point and solves discontinuous joint-acceleration under second-order constraints. Finally, we design two sets of experiments to verify the higher calculation efficiency and effectiveness of the proposed ATOF algorithm.
Mingli Wang 0006, Juliang Xiao, Sijiang Liu, Haitao Liu 0003
IEEE Trans. Robotics1