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

Seyedshams Feyzabadi

dblp:134/5231 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2020
—ORCID · none

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

Artificial intelligence and machine learning · 4 · 2 first-authorSystems, architecture and hardware · 4 · 2 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
3 papers
Reinforcement learning · 39% Robot manipulation · 18% Video understanding and tracking · 18%
Theoretical computer science
1 paper
Logic in computer science · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Reinforcement learning › markov decision process
constrained markov decision process
0.522016
Multi-objective planning with multiple high level task specifications · ICRA 2016
HCMDP: A hierarchical solution to Constrained Markov Decision Processes · ICRA 2015
Machine learning › Reinforcement learning
markov decision process
0.522016
Multi-objective planning with multiple high level task specifications · ICRA 2016
HCMDP: A hierarchical solution to Constrained Markov Decision Processes · ICRA 2015
Robotics › Robot manipulation › medical robotics
surgical robotics
0.412020
Temporal Segmentation of Surgical Sub-tasks through Deep Learning with Multiple Data Sources · ICRA 2020
Computer vision › Video understanding and tracking › temporal understanding
temporal segmentation
0.412020
Temporal Segmentation of Surgical Sub-tasks through Deep Learning with Multiple Data Sources · ICRA 2020
Logic in computer science › temporal logic
linear temporal logic
0.212016
Multi-objective planning with multiple high level task specifications · ICRA 2016
Robotics › Motion planning and robot control
path planning
0.212015
HCMDP: A hierarchical solution to Constrained Markov Decision Processes · ICRA 2015
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
risk-aware planning
0.212015
HCMDP: A hierarchical solution to Constrained Markov Decision Processes · ICRA 2015
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning
multi-objective planning
0.112016
Multi-objective planning with multiple high level task specifications · ICRA 2016
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
task planning
0.112016
Multi-objective planning with multiple high level task specifications · ICRA 2016

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

linear programming · 0.7product automaton · 0.5multi-source data fusion · 0.4finite-state machine modeling · 0.4monte carlo estimation · 0.2hierarchical state aggregation · 0.2
YearPublicationVenuePosition
2020 Temporal Segmentation of Surgical Sub-tasks through Deep Learning with Multiple Data Sources
abstract
Many tasks in robot-assisted surgeries (RAS) can be represented by finite-state machines (FSMs), where each state represents either an action (such as picking up a needle) or an observation (such as bleeding). A crucial step towards the automation of such surgical tasks is the temporal perception of the current surgical scene, which requires a real-time estimation of the states in the FSMs. The objective of this work is to estimate the current state of the surgical task based on the actions performed or events occurred as the task progresses. We propose Fusion-KVE, a unified surgical state estimation model that incorporates multiple data sources including the Kinematics, Vision, and system Events. Additionally, we examine the strengths and weaknesses of different state estimation models in segmenting states with different representative features or levels of granularity. We evaluate our model on the JHU-ISI Gesture and Skill Assessment Working Set (JIGSAWS), as well as a more complex dataset involving robotic intra-operative ultrasound (RIOUS) imaging, created using the da Vinci® Xi surgical system. Our model achieves a superior frame-wise state estimation accuracy up to 89.4%, which improves the state-of-the-art surgical state estimation models in both JIGSAWS suturing dataset and our RIOUS dataset.
Yidan Qin, Sahba Aghajani Pedram, Seyedshams Feyzabadi, Maximilian Allan, A. Jonathan McLeod, Joel W. Burdick, Mahdi Azizian
ICRA3
2020 daVinciNet: Joint Prediction of Motion and Surgical State in Robot-Assisted Surgery
abstract
This paper presents a technique to concurrently and jointly predict the future trajectories of surgical instruments and the future state(s) of surgical subtasks in robot-assisted surgeries (RAS) using multiple input sources. Such predictions are a necessary first step towards shared control and supervised autonomy of surgical subtasks. Minute-long surgical subtasks, such as suturing or ultrasound scanning, often have distinguishable tool kinematics and visual features, and can be described as a series of fine-grained states with transition schematics. We propose daVinciNet - an end-to-end dual-task model for robot motion and surgical state predictions. daVinciNet performs concurrent end-effector trajectory and surgical state predictions using features extracted from multiple data streams, including robot kinematics, endoscopic vision, and system events. We evaluate our proposed model on an extended Robotic Intra-Operative Ultrasound (RIOUS+) imaging dataset collected on a da Vinci® Xi surgical system and the JHU-ISI Gesture and Skill Assessment Working Set (JIGSAWS). Our model achieves up to 93.85% short-term (0.5s) and 82.11% long-term (2s) state prediction accuracy, as well as 1.07mm short-term and 5.62mm long-term trajectory prediction error.
Yidan Qin, Seyedshams Feyzabadi, Maximilian Allan, Joel W. Burdick, Mahdi Azizian
IROS2
2016 Multi-objective planning with multiple high level task specifications
abstract
We present an algorithm to solve a sequential stochastic decision making problem whereby a robot is subject to multiple objective functions and is asked to complete a number of subgoals specified using a subset of linear temporal logic. Each subgoal is associated with a desired satisfaction probability that will be met in expectation by the policy produced by the algorithm. Our method relies on the theory of constrained Markov Decision Processes and on methods coming from the realm of formal verification. The key idea is the definition of a product operation that can recursively incorporate more and more subgoals into the underlying planner. Ultimately, a policy is computed solving a linear program and we outline conditions for the existence and correctness of the solution. Our findings are validated in various simulation scenarios.
Seyedshams Feyzabadi, Stefano Carpin
ICRA1
2015 HCMDP: A hierarchical solution to Constrained Markov Decision Processes
abstract
Constrained Markov Decision Processes offer a principled way to tackle sequential decision problems with multiple objectives. Although they could be very valuable in numerous robotic applications, to date their use has been quite limited. One of the reasons is that their solution requires to solve constrained linear programs with a large number of variables and this is computationally demanding, especially when considering dynamic environments. In this paper we propose a hierarchical approach to solve large CMDPs. States are clustered into macro states and relevant parameters like transition probabilities and costs are extracted with a Monte Carlo approach. Macro states are created with the objective of grouping together states with similar costs while preserving feasibility. We illustrate the value of our findings in a path planning scenario where the robot moves through an environment characterized by different risk levels. Our approach largely outperforms the non-hierarchical method and we also show how it prevails over methods based on fixed partitioning strategies.
Seyedshams Feyzabadi, Stefano Carpin
ICRA1