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

Pi-Ying Cheng

dblp:20/10007 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2010
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 1 · 1 first-author

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 · 67% Robot manipulation · 33%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation
manipulator modeling
0.011988
Symbolic derivation of dynamic equations of motion for robot manipulators using Piogram symbolic method · IEEE J. Robotics Autom. 1988
Robotics › Motion planning and robot control
robot control
0.011988
Symbolic derivation of dynamic equations of motion for robot manipulators using Piogram symbolic method · IEEE J. Robotics Autom. 1988
Robotics › Motion planning and robot control
robot dynamics
0.011988
Symbolic derivation of dynamic equations of motion for robot manipulators using Piogram symbolic method · IEEE J. Robotics Autom. 1988

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

piogram symbolic method · 0.0newton-euler formalism · 0.0
YearPublicationVenuePosition
2010 The D++ algorithm: Real-Time and collision-free path-planning for mobile robot
abstract
This paper proposed an improved algorithm that we call “D++” which can be applied to real-time and collision-free path -planning to solve some problems of common methods at present. D++ algorithm combines the Dijkstra's algorithm with sensor-based method so that D++ algorithm can deal with problems of unknown, large, complex, or dynamic environment, and need only local environmental information initially to find a shortest path. In the later of this article, we demonstrated some examples to show that D++ algorithm is very efficient for path-planning and also very practicable on real mobile robot system.
Pi-Ying Cheng, Pin-Jyun Chen
IROS1
1988 Symbolic derivation of dynamic equations of motion for robot manipulators using Piogram symbolic method
abstract
An algorithm for both manual and automatic derivation of dynamic models of robotic manipulators using the Piogram symbolic method is presented. A program is also developed based on the Newton-Euler formalism by the Piogram symbolic representation method, which is applicable to manipulators of any degree of freedom. Two examples are given to illustrate how to use this program for dynamic equation generation. It is shown that the method has the advantage of simplifying the manipulation process, and thus a large amount of memory space and computing time when the method is implemented in a computer program.>
Pi-Ying Cheng, Ching-I Weng, Chao-Kuang Chen
IEEE J. Robotics Autom.1