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

Greetha Ramanathan

dblp:28/6469 · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1994
—ORCID · none

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

Theory of computation · 2 · 1 first-authorArtificial intelligence and machine learning · 1 · 1 first-authorSystems, architecture and hardware · 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 · 100%
Theoretical computer science
1 paper
Computational geometry · 100%

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

TopicWeightPapersLastEvidence papers
Robotics › Motion planning and robot control › collision avoidance
collision-free coordination
0.011985
Algorithmic motion planning in robotics: Coordinated motion of several disks amidst polygonal obstacles · ICRA 1985
Robotics › Motion planning and robot control › motion planning
multi-robot motion planning
0.011985
Algorithmic motion planning in robotics: Coordinated motion of several disks amidst polygonal obstacles · ICRA 1985
Computational geometry
motion planning
0.011985
Algorithmic motion planning in robotics: Coordinated motion of several disks amidst polygonal obstacles · ICRA 1985

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

computational geometry · 0.0complexity analysis · 0.0
YearPublicationVenuePosition
1994 Refinement of Events in the Development of Real-Time Distributed Systems
Greetha Ramanathan
Theor. Comput. Sci.1
1991 Functional Specification and Proof of Correctness for Time Dependent Behaviour of Reactive Systems
abstract
Abstract A functional formalism for describing and reasoning about the time dependent behaviour of reactive systems is presented. The model is event based and can describe the histories of events with finite duration. It is a generalisation of the model of Caspi and Halbwachs (1986). A set of tools with their operations are introduced in the formalism and structure theorems characterising the algebra of events are proved. The power of this extended model is illustrated through the formal specification and correctness proof for a problem chosen from robotics.
Vangalur S. Alagar, Greetha Ramanathan
Formal Aspects Comput.2
1985 Algorithmic motion planning in robotics: Coordinated motion of several disks amidst polygonal obstacles
abstract
Given k ≥ 2 circular disks D1, D2...Dkin a 2-dimensional region bounded by a finite set of polygonal obstacles, an algorithm to determine the existence of a collision free coordinated motion of the disks is given. The time complexity is shown to be O(nk} where n is the number of edges composing the walls. This algorithm is believed to be optimal.
Greetha Ramanathan, Vangalur S. Alagar
ICRA1