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

Arpita Sinha

dblp:27/3353 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0002-9116-3467ORCID · corroborated

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

Artificial intelligence and machine learning · 6 · 1 first-author · 2 since 2021Systems, architecture and hardware · 2 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 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
2 papers
Multi-agent systems · 92% Motion planning and robot control · 8%

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

TopicWeightPapersLastEvidence papers
Knowledge, reasoning and agents › Multi-agent systems › multi-robot coordination
multi-robot patrolling
0.512021
Priority Patrolling using Multiple Agents · ICRA 2021
Knowledge, reasoning and agents › Multi-agent systems › multi-robot systems
multi-robot surveillance
0.112021
Priority Patrolling using Multiple Agents · ICRA 2021
Knowledge, reasoning and agents › Multi-agent systems › collective behavior › swarm behavior › collective motion
cyclic pursuit
0.112007
Control of Agent Swarms Using Generalized Centroidal Cyclic Pursuit Laws · IJCAI 2007
Robotics › Motion planning and robot control › multi-robot control
multi-robot formation control
0.112007
Control of Agent Swarms Using Generalized Centroidal Cyclic Pursuit Laws · IJCAI 2007
Knowledge, reasoning and agents › Multi-agent systems › swarm robotics
swarm control
0.112007
Control of Agent Swarms Using Generalized Centroidal Cyclic Pursuit Laws · IJCAI 2007

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

time period based patrolling · 0.5centroidal cyclic pursuit · 0.1
YearPublicationVenuePosition
2024 Planning and tracking for safe autonomous overtaking and abort overtaking through a model predictive controller
abstract
This paper addresses trajectory planning for overtaking maneuvers in a dynamic, two-way, two-lane environment. The proposed novel five-stage planning algorithm comprises initial lane change, acceleration, final lane change, abort, and final lane change abort. This algorithm allows overtaking to be aborted in oncoming lane danger, reverting to the original lane. Employing a point mass model-based model predictive control (MPC) framework, separate longitudinal and lateral planning is conducted in each phase, combined to generate the overall trajectory. A practical nonlinear bicycle model is employed for trajectory tracking to address kinematic infeasibility. Furthermore, the tracking controller utilizes adaptive MPC. Numerical simulations validate the performance of the proposed algorithm.
Ishu Jaiswal, Ekansh Saraf, Arpita Sinha
IV3
2021 Priority Patrolling using Multiple Agents
abstract
The Patrolling Problem is a crucial feature of the surveillance task in defense and other establishments. Most of the works in the literature concentrate on reducing the Idleness value at each location in the environment. However, there are often a few prioritized locations that cannot be left unvisited beyond a certain Time Period. In this paper, we study the problem of Prioritized patrolling - the task of patrolling the given environment using multiple agents while ensuring the prioritized locations are visited within the pre-specified Time Period. We present a novel algorithm, namely, Time Period Based Patrolling (TPBP) algorithm, to solve the prioritized patrolling problem. It determines a sequence of walks for each agent online that complies with the Time Period requirement of the Priority nodes while reducing the Idleness of all the other nodes. We have tested and validated the algorithm using SUMO - a realistic simulator developed for traffic management. Since the existing strategies are not designed for Prioritized Patrolling, we show through comparison that proposed algorithm is required to solve the problem.
Deepak Mallya, Sumanth Kandala, Leena Vachhani, Arpita Sinha
ICRA4
2016 Collision-free trajectory planning on Lissajous curves for repeated multi-agent coverage and target detection
abstract
This paper proposes a trajectory planning strategy to simultaneously address multiple surveillance objectives such as complete area coverage, periodic surveillance, and guaranteed detection of a rogue element attempting to exit the area of interest. For agents with identical sensing capability, the proposed strategy defines a time-varying multi-agent formation on a Lissajous curve, which completes the aforementioned tasks in finite time with collision free paths for all agents in a 2-D rectangular region. This obviates the need for sensing and communication for collision avoidance among agents. A sufficient upper limit on agent dimensions that ensures collision free motion is derived. An algorithm is developed for choosing the number of agents and optimal Lissajous curve for a prescribed rectangle and agents' sensing capability. The optimal Lissajous curve is chosen to minimize the time period for repeated coverage and maximize the upper bound on agent size. The proposed algorithm is validated through computer simulations and experiments using differential drive robots.
Aseem Vivek Borkar, Arpita Sinha, Leena Vachhani, Hemendra Arya
IROS2
2013 A novel obstacle avoidance control algorithm in a dynamic environment
abstract
This paper is concerned with obstacle avoidance control strategy of unicycle mobile robot in a dynamic environment. We propose a control algorithm based on collision cone approach to avoid collision with stationary obstacle. The algorithm is simple and easy to implement in the real world applications. The proposed algorithm is extended to the case of moving obstacle as well as irregular obstacle. The effectiveness of the proposed control algorithms are demonstrated through various simulations.
Galib R. Mallik, Arpita Sinha
CISDA2
2008 Analytical Structures for Fuzzy PID Controllers?
abstract
In this paper, analytical structures for fuzzy proportional-integral-derivative (PID) controllers are derived by using triangular membership functions for inputs, singletons, or triangular membership functions for output, minimum triangular norm, maximum or drastic sum triangular conorm, Mamdani minimum, drastic or Larsen product inference, nonlinear control rules, and center-of-sum defuzzification. It is shown that these analytical structures are not suitable for control purpose. In this context, it is extremely important to note that the analytical structures reported by Carvajal et al. are also not valid for control.
B. M. Mohan, Arpita Sinha
IEEE Trans. Fuzzy Syst.2
2007 Control of Agent Swarms Using Generalized Centroidal Cyclic Pursuit Laws
Arpita Sinha, Debasish Ghose
IJCAI1
2006 The simplest fuzzy PID controllers: mathematical models and stability analysis
B. M. Mohan, Arpita Sinha
Soft Comput.2