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.

K. Jayarajan

dblp:98/2010 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
0since 2021 · last 1997
0000-0002-7157-8913ORCID · reported

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

Artificial intelligence and machine learning · 3Systems, architecture and hardware · 3Applied, interdisciplinary, general and emerging computing · 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
4 papers
Robot manipulation · 40% Legged, aerial and field robots · 40% Motion planning and robot control · 20%

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

TopicWeightPapersLastEvidence papers
Robotics › Robot manipulation › grasping › gripper design
dexterous gripper design
0.011997
Development of a dextrous gripper for nuclear applications · ICRA 1997
Robotics › Robot manipulation
grasping
0.011997
Development of a dextrous gripper for nuclear applications · ICRA 1997
Robotics › Legged, aerial and field robots › legged robots › legged robot locomotion
free gait generation
0.021991
Generation of free gait-a graph search approach · IEEE Trans. Robotics Autom. 1991
A free gait for generalized motion · IEEE Trans. Robotics Autom. 1990
Robotics › Legged, aerial and field robots › legged robots
legged robot locomotion
0.021991
Generation of free gait-a graph search approach · IEEE Trans. Robotics Autom. 1991
A free gait for generalized motion · IEEE Trans. Robotics Autom. 1990
Robotics › Legged, aerial and field robots
legged robots
0.011994
Gait Generation for a Six-Legged Walking Machine Through Graph Search · ICRA 1994
Robotics › Motion planning and robot control
motion planning
0.011994
Gait Generation for a Six-Legged Walking Machine Through Graph Search · ICRA 1994
Robotics › Motion planning and robot control › robot control
force control
0.011997
Development of a dextrous gripper for nuclear applications · ICRA 1997
Robotics › Robot manipulation › tactile sensing
slip detection
0.011997
Development of a dextrous gripper for nuclear applications · ICRA 1997
Robotics › Motion planning and robot control
robot control
0.011994
Gait Generation for a Six-Legged Walking Machine Through Graph Search · ICRA 1994

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

slip detection · 0.0force control · 0.0heuristic graph search · 0.0a* search · 0.0heuristic search · 0.0graph search · 0.0
YearPublicationVenuePosition
1997 Development of a dextrous gripper for nuclear applications
abstract
The need for dextrous manipulation arises when the physical dimensions and mechanical properties of the materials to be handled may not be known precisely. For such applications the gripper should be able to control the position of its finger or the force which it exerts on the object, and also be able to detect slip and take corrective action. This paper describes certain aspects of design involved and experiments carried out using a dextrous gripper which is being developed for nuclear applications.
A. Dutta, G. R. Muzumdar, V. T. Shirwalkar, K. Jayarajan, D. Venkatesh, M. S. Ramakumar
ICRA4
1994 Gait Generation for a Six-Legged Walking Machine Through Graph Search
abstract
A walking machine must plan its footsteps in such a way that it is able to follow the desired route without stepping over the bad patches on the ground. A good way of doing this is to search through a graph of possible moves. We have previously done that for a four-legged machine (1990, 1991). For a six-legged machine, however, there are too many ways of choosing a stable support pattern. So, strong heuristics are needed to reduce the search. In this paper, a novel heuristic rule, based on the support state transitions of the wave gait, has been presented. This rule helps in converging to and maintaining the wave gait through a limited search, while retaining adequate options to deviate from the wave gait, as and when needed, to adapt to the terrain, or to execute a generalised motion. Thus, we have a gait generation mechanism that combines the efficiency of the wave gait with the terrain adaptivity of the free gait.>
Prabir K. Pal, Mahadev Venkatraman, K. Jayarajan
ICRA3
1994 Generation of optimal configuration for a redundant manipulator with a trained neural network
abstract
Redundant manipulators have more degrees of freedom than what is absolutely necessary for performing a task. The extra degrees of freedom can be used for avoiding obstacles or to optimize certain performance indices like manipulability or task compatibility. Maximizing manipulability keeps the manipulator away from singularities and provides more velocity transmission ratios in all directions. Optimizing task compatibility improves the force/velocity transmission ratios in the specified directions. However, the real time implementation of various optimizing algorithms is difficult because of the need of large computing time. In the present work, robot configurations for an optimum performance index are computed throughout the workspace. These configurations are then used to train a layered feed forward neural network (FFNN). During operation of the robot, the trained neural net outputs optimal configurations in real-time. The neural net captures the gross behaviour of the training data rather than memorizing the individual data, as in a lookup table. Thus its output is smooth and ideally suited for control purposes. We have simulated this approach on a 3-DOF redundant planar manipulator and the results are discussed in this paper.>
Dayal C. Kar, K. Jayarajan, Prabir K. Pal
IROS2
1991 Generation of free gait-a graph search approach
abstract
A method is presented for the generation of a free gait for the straight-line motion of a quadruped walking machine. It uses a heuristic graph search procedure based on the A* algorithm. The method essentially looks into the consequences of a move to a certain depth before actually committing to it. Deadlocks and inefficiencies are thus sensed well in advance and avoided.>
Prabir K. Pal, K. Jayarajan
IEEE Trans. Robotics Autom.2
1990 A free gait for generalized motion
abstract
A method is presented for the generation of a locally optimal free gait for 2-D generalized motion of a quadruped walking machine. It employs a heuristic graph search procedure based on the A* algorithm. The method essentially looks into the consequences of a move to a certain depth before actually committing to it. Deadlocks and inefficiencies are thus sensed well in advance and avoided.>
Prabir K. Pal, K. Jayarajan
IEEE Trans. Robotics Autom.2