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

Sushil K. Agrawal

dblp:71/6112 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 2001
—ORCID · none

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

Systems, architecture and hardware · 2 · 1 first-authorArtificial intelligence and machine learning · 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.

Theoretical computer science
1 paper
Mathematical optimization · 100%
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
trajectory optimization
0.011996
Optimal trajectories of open-chain mechanical systems: Explicit optimality equation with multiple shooting solution · ICRA 1996
Mathematical optimization › control theory
optimal control
0.011996
Optimal trajectories of open-chain mechanical systems: Explicit optimality equation with multiple shooting solution · ICRA 1996
Mathematical optimization
two-point boundary value problem
0.011996
Optimal trajectories of open-chain mechanical systems: Explicit optimality equation with multiple shooting solution · ICRA 1996

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

multiple shooting · 0.0integral cost functional · 0.0differential-algebraic equations · 0.0
YearPublicationVenuePosition
2001 A Protocol for Load Sharing among a Cluster of Heterogeneous Unix Workstations
abstract
In this paper we propose a protocol for load sharing among a cluster of heterogeneous Unix workstations. Our protocol called the distributed process management protocol (DPMP), not only enables load sharing using nonpreemptive process migration but also seamlessly integrates the processes running on a network of machines. Remote processes can be accessed (for signalling, for example), in the same way as local processes making process migration highly transparent to the users and the applications. DPMP also has built in mechanisms to detect and recover from node and network failures. DPMP can be implemented at either the kernel or the user level. We also describe an implementation of DPMP within the Linux kernel. Preliminary performance studies show that the performance gains obtained by using DPMP are substantial.
Deepak Gupta 0001, Ashish Gupta 0009, Sushil K. Agrawal, Vikas Agarwal, Pradip Bepari
CCGRID3
1996 Optimal trajectories of open-chain mechanical systems: Explicit optimality equation with multiple shooting solution
abstract
This paper addresses the problem of finding globally optimal trajectories of multi-degree-of-freedom open-chain systems while minimizing integral cost functionals. The contributions of this paper are: (i) explicit optimality equations in terms of inertia matrix and potential energy of the system, (ii) compatability conditions on the terminal conditions of the system consistent with the cost functional, (iii) robust computational procedure for solving the two-point boundary value problem in differential-algebraic equations using multiple shooting method, and (iv) an integrated software for dynamic optimization and simulation of open-chain systems.
Sushil K. Agrawal, Brian C. Fabien
ICRA1