default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArmin Sadeghi
Person information
- affiliation (PhD 2020): University of Waterloo, Department of Electrical and Computer Engineering, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j9]Barry Gilhuly
, Armin Sadeghi, Stephen L. Smith:
Estimating Visibility From Alternate Perspectives for Motion Planning With Occlusions. IEEE Robotics Autom. Lett. 9(6): 5583-5590 (2024)- [j8]Tristan Walker, Barry Gilhuly, Armin Sadeghi, Matt Delbosc, Stephen L. Smith:
Predictive Dead Reckoning for Online Peer-to-Peer Games. IEEE Trans. Games 16(1): 173-184 (2024) - [j7]Alexander Botros, Nils Wilde, Armin Sadeghi, Javier Alonso-Mora, Stephen L. Smith:
Regret-Based Sampling of Pareto Fronts for Multiobjective Robot Planning Problems. IEEE Trans. Robotics 40: 3778-3794 (2024) - [i8]Barry Gilhuly, Armin Sadeghi, Stephen L. Smith:
Estimating Visibility from Alternate Perspectives for Motion Planning with Occlusions. CoRR abs/2404.07781 (2024) - 2023
- [j6]Alexander Botros, Barry Gilhuly, Nils Wilde, Armin Sadeghi, Javier Alonso-Mora, Stephen L. Smith:
Optimizing Task Waiting Times in Dynamic Vehicle Routing. IEEE Robotics Autom. Lett. 8(9): 5520-5527 (2023) - [j5]Armin Sadeghi Yengejeh, Ahmad Bilal Asghar, Stephen L. Smith:
Distributed Multirobot Coverage Control of Nonconvex Environments With Guarantees. IEEE Trans. Control. Netw. Syst. 10(2): 796-808 (2023) - [c9]Giovanni D'Urso, Armin Sadeghi, Chanyeol Yoo, Stephen L. Smith, Robert Fitch:
Distributed Multi-Robot Equitable Partitioning Algorithm for Allocation in Warehouse Picking Scenarios. CASE 2023: 1-8 - [i7]Alexander Botros, Barry Gilhuly, Nils Wilde, Armin Sadeghi, Javier Alonso-Mora, Stephen L. Smith:
Optimizing Task Waiting Times in Dynamic Vehicle Routing. CoRR abs/2307.03984 (2023) - 2022
- [j4]Nils Wilde, Armin Sadeghi, Stephen L. Smith:
Learning Submodular Objectives for Team Environmental Monitoring. IEEE Robotics Autom. Lett. 7(2): 960-967 (2022) - [j3]Florence Tsang, Tristan Walker, Ryan A. MacDonald, Armin Sadeghi, Stephen L. Smith:
LAMP: Learning a Motion Policy to Repeatedly Navigate in an Uncertain Environment. IEEE Trans. Robotics 38(3): 1638-1652 (2022) - [c8]Barry Gilhuly, Armin Sadeghi, Peyman Yadmellat, Kasra Rezaee, Stephen L. Smith:
Looking for Trouble: Informative Planning for Safe Trajectories with Occlusions. ICRA 2022: 8985-8991 - [c7]Alexander Botros, Armin Sadeghi, Nils Wilde, Javier Alonso-Mora, Stephen L. Smith:
Error-Bounded Approximation of Pareto Fronts in Robot Planning Problems. WAFR 2022: 506-522 - [i6]Alexander Botros, Armin Sadeghi, Nils Wilde, Javier Alonso-Mora, Stephen L. Smith:
Error-Bounded Approximation of Pareto Fronts in Robot Planning Problems. CoRR abs/2206.00663 (2022) - 2021
- [j2]Armin Sadeghi Yengejeh, Stephen L. Smith:
Rebalancing Self-Interested Drivers in Ride-Sharing Networks to Improve Customer Wait-Time. IEEE Trans. Control. Netw. Syst. 8(4): 1637-1648 (2021) - [c6]Armin Sadeghi, Ahmad Bilal Asghar, Stephen L. Smith:
Approximation Algorithms for Distributed Multi-robot Coverage in Non-convex Environments. WAFR 2021: 330-346 - [i5]Nils Wilde, Armin Sadeghi, Stephen L. Smith:
Learning Submodular Objectives for Team Environmental Monitoring. CoRR abs/2112.08000 (2021) - 2020
- [i4]Armin Sadeghi, Ahmad Bilal Asghar, Stephen L. Smith:
Approximation Algorithms for Distributed Multi-Robot Coverage in Non-Convex Environments. CoRR abs/2005.02471 (2020) - [i3]Florence Tsang, Tristan Walker, Ryan A. MacDonald, Armin Sadeghi, Stephen L. Smith:
LAMP: Learning a Motion Policy to Repeatedly Navigate in an Uncertain Environment. CoRR abs/2012.02271 (2020)
2010 – 2019
- 2019
- [c5]Armin Sadeghi, Stephen L. Smith:
On Re-Balancing Self-Interested Agents in Ride-Sourcing Transportation Networks. CDC 2019: 5119-5125 - [c4]Armin Sadeghi, Stephen L. Smith:
Coverage Control for Multiple Event Types with Heterogeneous Robots. ICRA 2019: 3377-3383 - [c3]Armin Sadeghi, Ahmad Bilal Asghar, Stephen L. Smith:
On Minimum Time Multi-Robot Planning with Guarantees on the Total Collected Reward. MRS 2019: 16-22 - [i2]Armin Sadeghi, Stephen L. Smith:
On Re-Balancing Self-Interested Agents in Ride-Sourcing Transportation Networks. CoRR abs/1909.04615 (2019) - 2018
- [c2]Armin Sadeghi, Stephen L. Smith:
Re-Deployment Algorithms for Multiple Service Robots to Optimize Task Response. ICRA 2018: 2356-2363 - 2017
- [j1]Armin Sadeghi, Stephen L. Smith:
Heterogeneous Task Allocation and Sequencing via Decentralized Large Neighborhood Search. Unmanned Syst. 5(2): 79-95 (2017) - 2016
- [c1]Armin Sadeghi, Stephen L. Smith:
On efficient computation of shortest Dubins paths through three consecutive points. CDC 2016: 6010-6015 - [i1]Armin Sadeghi, Stephen L. Smith:
On Efficient Computation of Shortest Dubins Paths Through Three Consecutive Points. CoRR abs/1609.06662 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
