Name
Playground
About
FAQ
GitHub
Playground
Shortest Path Finder
Community Detector
Connected Papers
Author Trending
Koh Aoki
Guanbin Li
Bhupendra Singh
Silvia Scirpoli
David J. Westover
Songhua Li
Hai-Yan Yu
Sebastian Magda
David MacDonald
Zhicai Ou
Home
/
Author
/
KIRIL SOLOVEY
Author Info
Open Visualization
Name
Affiliation
Papers
KIRIL SOLOVEY
Blavatnik School of Computer Science, Tel-Aviv University, Israel
26
Collaborators
Citations
PageRank
37
71
10.30
Referers
Referees
References
107
378
268
Search Limit
100
378
Publications (26 rows)
Collaborators (37 rows)
Referers (100 rows)
Referees (100 rows)
Title
Citations
PageRank
Year
Coordinated Multi-Agent Pathfinding for Drones and Trucks over Road Networks.
0
0.34
2022
Balancing Fairness and Efficiency in Traffic Routing via Interpolated Traffic Assignment.
0
0.34
2022
Resolution-Optimal Motion Planning for Steerable Needles.
0
0.34
2022
Near-Optimal Multi-Robot Motion Planning with Finite Sampling
0
0.34
2021
Fast, High-Quality Two-Arm Rearrangement in Synchronous, Monotone Tabletop Setups
0
0.34
2021
Fast Near-Optimal Heterogeneous Task Allocation via Flow Decomposition
0
0.34
2021
When Efficiency meets Equity in Congestion Pricing and Revenue Refunding Schemes.
0
0.34
2021
On Local Computation for Network-Structured Convex Optimization in Multiagent Systems
0
0.34
2021
Refined Analysis of Asymptotically-Optimal Kinodynamic Planning in the State-Cost Space.
0
0.34
2020
The critical radius in sampling-based motion planning
2
0.39
2020
Revisiting the Asymptotic Optimality of RRT*
1
0.36
2020
Efficient Large-Scale Multi-Drone Delivery Using Transit Networks
2
0.39
2020
Exploiting Locality and Structure for Distributed Optimization in Multi-Agent Systems
0
0.34
2020
Sample Complexity of Probabilistic Roadmaps via ε-nets.
0
0.34
2020
dRRT*: Scalable and Informed Asymptotically-Optimal Multi-Robot Motion Planning.
1
0.36
2019
Fast, High-Quality Dual-Arm Rearrangement in Synchronous, Monotone Tabletop Setups.
0
0.34
2018
Probabilistic completeness of RRT for geometric and kinodynamic planning with forward propagation.
1
0.37
2018
Scalable asymptotically-optimal multi-robot motion planning
1
0.35
2017
Sampling-based bottleneck pathfinding with applications to Frechet matching.
0
0.34
2016
On the hardness of unlabeled multi-robot motion planning
19
0.69
2016
New perspective on sampling-based motion planning via random geometric graphs
4
0.41
2016
Motion Planning for Multilink Robots by Implicit Configuration-Space Tiling.
1
0.35
2015
PSPACE-hardness of unlabeled motion planning and variants.
1
0.35
2014
Finding a Needle in an Exponential Haystack: Discrete RRT for Exploration of Implicit Roadmaps in Multi-robot Motion Planning.
7
0.59
2013
Efficient Multi-robot Motion Planning for Unlabeled Discs in Simple Polygons.
8
0.55
2013
k-color multi-robot motion planning
23
0.75
2012
1
