default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAli Reza Pedram
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j2]Ali Reza Pedram
, Riku Funada, Takashi Tanaka:
Gaussian Belief Space Path Planning for Minimum Sensing Navigation. IEEE Trans. Robotics 39(3): 2040-2059 (2023)- 2021
- [j1]Takashi Tanaka, Ehsan Nekouei, Ali Reza Pedram, Karl Henrik Johansson:
Linearly Solvable Mean-Field Traffic Routing Games. IEEE Trans. Autom. Control. 66(2): 880-887 (2021)
Conference and Workshop Papers
- 2023
- [c7]Ali Reza Pedram, Takashi Tanaka:
A Smoothing Algorithm for Minimum Sensing Path Plans in Gaussian Belief Space. ACC 2023: 3304-3309 - 2021
- [c6]Ali Reza Pedram, Jeb Stefan, Riku Funada, Takashi Tanaka:
Rationally Inattentive Path-Planning via RRT. ACC 2021: 3440-3446 - [c5]Ali Reza Pedram, Riku Funada, Takashi Tanaka:
Dynamic Allocation of Visual Attention for Vision-based Autonomous Navigation under Data Rate Constraints. CDC 2021: 6243-6250 - 2020
- [c4]Ali Reza Pedram, Takashi Tanaka:
Closed-loop Parameter Identification of Linear Dynamical Systems through the Lens of Feedback Channel Coding Theory. ACC 2020: 5145-5150 - 2019
- [c3]Ali Reza Pedram, Takashi Tanaka:
Linearly-Solvable Mean-Field Approximation for Multi-Team Road Traffic Games. CDC 2019: 1243-1248 - [c2]Ali Reza Pedram, Takashi Tanaka, Matthew T. Hale:
Bidirectional Information Flow and the Roles of Privacy Masks in Cloud-Based Control. ITW 2019: 1-5 - 2018
- [c1]Ali Reza Pedram, Takashi Tanaka:
Some Results on the Computation of Feedback Capacity of Gaussian Channels with Memory. Allerton 2018: 919-926
Informal and Other Publications
- 2023
- [i8]Ali Reza Pedram, Takashi Tanaka:
A Smoothing Algorithm for Minimum Sensing Path Plans in Gaussian Belief Space. CoRR abs/2303.07326 (2023) - [i7]Vrushabh Zinage, Ali Reza Pedram, Takashi Tanaka:
Optimal Sampling-based Motion Planning in Gaussian Belief Space for Minimum Sensing Navigation. CoRR abs/2306.00264 (2023) - 2021
- [i6]Hyunho Jung, Ali Reza Pedram, Travis Craig Cuvelier, Takashi Tanaka:
Optimized Data Rate Allocation for Dynamic Sensor Fusion over Resource Constrained Communication Networks. CoRR abs/2106.04001 (2021) - [i5]Ali Reza Pedram, Riku Funada, Takashi Tanaka:
Dynamic Allocation of Visual Attention for Vision-based Autonomous Navigation under Data Rate Constraints. CoRR abs/2109.13146 (2021) - [i4]Ali Reza Pedram, Riku Funada, Takashi Tanaka:
Gaussian Belief Space Path Planning for Minimum Sensing Navigation. CoRR abs/2109.13976 (2021) - 2020
- [i3]Jeb Stefan, Ali Reza Pedram, Riku Funada, Takashi Tanaka:
Rationally Inattentive Path-Planning via RRT. CoRR abs/2002.12494 (2020) - [i2]Ali Reza Pedram, Takashi Tanaka:
Closed-loop Parameter Identification of Linear Dynamical Systems through the Lens of Feedback Channel Coding Theory. CoRR abs/2003.12548 (2020) - 2019
- [i1]Ali Reza Pedram, Takashi Tanaka, Matthew T. Hale:
Bidirectional Information Flow and the Roles of Privacy Masks in Cloud-Based Control. CoRR abs/1905.07459 (2019)
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 2024-04-24 23:16 CEST 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:
