Daigo Shishika

Daigo Shishika

Auto-generated profile, based on publicly available information

Daigo Shishika

Department of Mechanical Engineering, George Mason University, Fairfax, VA, USA

Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
10 February 2020 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
DSDaigo Shishika
Daigo Shishika
JPJames Paulos
James Paulos
VKVijay Kumar
Vijay Kumar
This paper studies a variant of the multi-player reach-avoid game played between intruders and defenders with applications to perimeter defense. The intruder team tries to score by sending as many intruders as possible to the target area, while the defender team tries to minimize this score by intercepting them. Finding the optimal strategies of the game is challenging due to the high dimensionality of the joint state space, and the existing works have proposed approximation methods to reduce the design of the defense strategy into assignment problems. However they suffer from either suboptimal defender performance or computational complexity. Based on a novel decomposition method, this paper proposes a scalable (polynomial-time) assignment algorithm that accommodates cooperative behaviors and outperforms the existing defense strategies. For a certain class of initial configurations, we derive the exact score by showing that the lower bound provided by the intruder team matches the upper bound provided by the defender team, which also proves the optimality of the team strategies.

22 December 2020
Verified
Book Chapter
Closed access
PDF file
DSDaigo Shishika
Daigo Shishika
VKVijay Kumar
Vijay Kumar

1 September 2022 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
AMAlexander Von Moll
Alexander Von Moll
MPMeir Pachter
Meir Pachter
DSDaigo Shishika
Daigo Shishika
ZFZachariah Fuchs
Zachariah Fuchs
In this paper, the problem of guarding a circular target wherein the Defender(s) is constrained to move along its perimeter is posed and solved using a differential game theoretic approach. Both the one-Defender and two-Defender scenarios are analyzed and solved. The mobile Attacker seeks to reach the perimeter of the circular target, whereas the Defender(s) seeks to align itself with the Attacker, thereby ending the game. In the former case, the Attacker wins, and the Attacker and Defender play a zero-sum differential game where the payoff/cost is the terminal angular separation. In the latter case, the Defender(s) wins, and the Attacker and Defender play a zero-sum differential game where the cost/payoff is the Attacker's terminal distance to the target. This formulation is representative of a scenario in which the Attacker inflicts damage on the target as a function of its terminal distance. The state-feedback equilibrium strategies and Value functions for the Attacker-win and Defender(s)-win scenarios are derived for both the one- and two-Defender cases, thus providing a solution to the Game of Degree. Analytic expressions for the separating surfaces between the various terminal scenarios are derived, thus providing a solution to the Game of Kind. An alternative game is formulated and solved in the case of Attacker win wherein the Attacker seeks to minimize time to reach the target.

1 July 2021 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
XYXi Yu
Xi Yu
DSDavid Saldana
David Saldana
DSDaigo Shishika
Daigo Shishika
MHM. Ani Hsieh
M. Ani Hsieh
In this article, we propose an approach to construct a time-varying communication topology with a resilient consensus performance for robot swarms with limited communication ranges. The robots are deployed to explore a large task space and achieve consensus despite the existence of a finite number of noncooperative members in the team. Existing methods encouraged robots to stay close to each other to achieve certain robustness requirements on the connectivity of the communication topology. We leverage on the robots’ mobility to design a time-varying integrated topology composed of several subgroups of robots deployed on nonoverlapping closed-loop paths. Robots are spread out and move along the paths, forming periodic communication links within or across groups. We analyze the time-varying topology synthesized and provide sufficient conditions for individual subgroups and the interconnection between them. We show designs satisfying the conditions with simulated examples in a lattice space, as well as in a task space with predefined paths.

23 May 2022 in IEEE Transactions on Aerospace and Electronic Systems
Verified
Journal Article
Closed access
AMAlexander Von Moll
Alexander Von Moll
DSDaigo Shishika
Daigo Shishika
ZFZachariah Fuchs
Zachariah Fuchs
MDMichael Dorothy
Michael Dorothy
A scenario is considered in which two cooperative Attackers aim to infiltrate a circular target guarded by a Turret. The engagement plays out in the two dimensional plane; the holonomic Attackers have the same speed and move with simple motion and the Turret is stationary, located at the target circle's center, and has a bounded turn rate. When the Turret's look angle is aligned with an Attacker, that Attacker is neutralized. In this paper, we focus on a region of the state space wherein only one of the Attackers is able to reach the target circle - and even then, only with the help of its partner Attacker. The Runner distracts the Turret long until it is neutralized, which allows the Penetrator to gain a positional advantage and guarantee success in hitting the target circle. We formulate the Turret-Runner-Penetrator scenario as a differential game over the Value of the subsequent game of min/max terminal angle which takes place between the Turret and Penetrator once the Runner has been neutralized. The solution to the Game of Degree, including equilibrium Turret, Runner, and Penetrator strategies, as well as the Value function are given. The case in which the Penetrator can reach the target before the Turret can neutralize the Runner is formulated and solved. Finally, the assumption of a priori defined roles/goals is relaxed and the minimum of the solutions to the two fixed-role games is shown to be a Global Stackelberg Equilibrium.

31 January 2019 in Autonomous Robots
Verified
Journal Article
Closed access
PDF file
DSDaigo Shishika
Daigo Shishika
DPDerek A. Paley
Derek A. Paley