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

Y. Ding

dblp:60/5941 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1994
—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

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
Legged, aerial and field robots · 56% Motion planning and robot control · 44%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Embedded and real-time systems · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › path planning
deadlock avoidance
0.011994
Deadlock Avoidance for a Quadruped with Free Gait · ICRA 1994
Robotics › Legged, aerial and field robots
legged robots
0.011994
Deadlock Avoidance for a Quadruped with Free Gait · ICRA 1994
Embedded and real-time systems › real-time scheduling
fixed-priority scheduling
0.011989
The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior · RTSS 1989
Embedded and real-time systems › real-time scheduling › fixed-priority scheduling
rate-monotonic scheduling
0.011989
The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior · RTSS 1989
Embedded and real-time systems
real-time scheduling
0.011989
The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior · RTSS 1989
Embedded and real-time systems › real-time scheduling
schedulability analysis
0.011989
The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior · RTSS 1989
Robotics › Legged, aerial and field robots
stability margin
0.011994
Deadlock Avoidance for a Quadruped with Free Gait · ICRA 1994

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

foot force constraint · 0.0center of gravity shifting · 0.0stochastic analysis · 0.0
YearPublicationVenuePosition
1994 Deadlock Avoidance for a Quadruped with Free Gait
abstract
Free gait is seen as a basis for the coordination of legs in locomotion over irregular terrain, in particular the terrain containing forbidden zones. However, deadlock, a situation in which further movement of a legged vehicle in the desired direction is impossible due to negative stability margin or zero kinematic margin, frequently occur to the free gait. It could be avoided by imposing restrictions on leg reachable volumes for foothold selection, but this may lead to another situation in which no foothold would be found. This paper introduces an alternative method to maintain the stability margin positive for free gait by moving manipulator arms equipped on the vehicle to shift the centre of gravity of the vehicle. The shift in the centre of gravity is measured by use of foot forces through foot force constraint equations. In this paper, an adaptive leg lift-forward time/velocity is also introduced to realize continuous locomotion using minimum stroke to achieve maximum stride. Simulations have demonstrated the feasibility of the proposed algorithms for a quadruped.>
Y. Ding, E. Scharf
ICRA1
1989 The Rate Monotonic Scheduling Algorithm: Exact Characterization and Average Case Behavior
abstract
An exact characterization of the ability of the rate monotonic scheduling algorithm to meet the deadlines of a periodic task set is represented. In addition, a stochastic analysis which gives the probability distribution of the breakdown utilization of randomly generated task sets is presented. It is shown that as the task set size increases, the task computation times become of little importance, and the breakdown utilization converges to a constant determined by the task periods. For uniformly distributed tasks, a breakdown utilization of 88% is a reasonable characterization. A case is shown in which the average-case breakdown utilization reaches the worst-case lower bound of C.L. Liu and J.W. Layland (1973).>
John P. Lehoczky, Lui Sha, Y. Ding
RTSS3