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

P. Nirmal

dblp:123/6344 · also Paramesh Nirmal, Prem Nirmal · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2015
—ORCID · none

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

Artificial intelligence and machine learning · 2Systems, architecture and hardware · 2Applied, 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
Planning, search and constraint satisfaction · 77% Motion planning and robot control · 23%
Software engineering, system software, and programming languages
1 paper
Program verification · 100%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning › planning evaluation
plan verification
0.212015
Performance Verification for Behavior-Based Robot Missions · IEEE Trans. Robotics 2015
Program verification
model checking
0.212015
Performance Verification for Behavior-Based Robot Missions · IEEE Trans. Robotics 2015
Robotics › Motion planning and robot control › robot control
behavior-based control
0.112015
Performance Verification for Behavior-Based Robot Missions · IEEE Trans. Robotics 2015

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

process algebra · 0.4bayesian network filtering · 0.4
YearPublicationVenuePosition
2015 Performance Verification for Behavior-Based Robot Missions
abstract
Certain robot missions need to perform predictably in a physical environment that may have significant uncertainty. One approach is to leverage automatic software verification techniques to establish a performance guarantee. The addition of an environment model and uncertainty in both program and environment, however, means that the state space of a model-checking solution to the problem can be prohibitively large. An approach based on behavior-based controllers in a process-algebra framework that avoids state-space combinatorics is presented here. In this approach, verification of the robot program in the uncertain environment is reduced to a filtering problem for a Bayesian network. Validation results are presented for the verification of a multiple-waypoint and an autonomous exploration robot mission.
Damian M. Lyons, Ronald C. Arkin, Shu D. Jiang, Tsung-Ming Liu, P. Nirmal
IEEE Trans. Robotics5
2013 Getting it right the first time: Robot mission guarantees in the presence of uncertainty
abstract
Certain robot missions need to perform predictably in a physical environment that may only be poorly characterized in advance. We have previously developed an approach to establishing performance guarantees for behavior-based controllers in a process-algebra framework. We extend that work here to include random variables, and we show how our prior results can be used to generate a Dynamic Bayesian Network for the coupled system of program and environment model. Verification is reduced to a filtering problem for this network. Finally, we present validation results that demonstrate the effectiveness of the verification of a multiple waypoint robot mission using this approach.
Damian M. Lyons, Ronald C. Arkin, P. Nirmal, Shu D. Jiang, Tsung-Ming Liu, J. Deeb
IROS3
2012 Designing autonomous robot missions with performance guarantees
abstract
This paper describes the need and methods required to construct an integrated software verification and mission specification system for use in robotic missions intended for counter-weapons of mass destruction (c-WMD) operations, as part of a 3-year effort for the Defense Threat Reduction Agency. The overall system architecture is described. The principal tool for verification is a process algebra, PARS, based on port automata theory. PARS is introduced, emphasizing its ability to represent probabilistic programs and uncertain and dynamic environments, followed by the analysis of mission properties for an example robotic mission.
Damian M. Lyons, Ronald C. Arkin, P. Nirmal, Shu D. Jiang
IROS3