default search action
Daniel Silvestre
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Pedro Taborda
, Hugo Matias
Convex MPC and Thrust Allocation With Deadband for Spacecraft Rendezvous. IEEE Control. Syst. Lett. 8: 1132-1137 (2024) - [j18]Guilherme Ramos
A Discrete-Time Reputation-Based Resilient Consensus Algorithm for Synchronous or Asynchronous Communications. IEEE Trans. Autom. Control. 69(1): 543-550 (2024) - [i4]Hugo Matias, Daniel Silvestre:
Model-Predictive Trajectory Generation for Autonomous Aerial Search and Coverage. CoRR abs/2403.05944 (2024) - [i3]Pedro Taborda, Hugo Matias, Daniel Silvestre, Pedro Lourenço:
Convex MPC and Thrust Allocation with Deadband for Spacecraft Rendezvous. CoRR abs/2404.04197 (2024) - 2023
- [j17]Daniel Silvestre
Model Predictive Control With Collision Avoidance for Unknown Environment. IEEE Control. Syst. Lett. 7: 2821-2826 (2023) - [j16]Anis Yazidi
Solving Two-Person Zero-Sum Stochastic Games With Incomplete Information Using Learning Automata With Artificial Barriers. IEEE Trans. Neural Networks Learn. Syst. 34(2): 650-661 (2023) - [c14]Francisco Santos, Daniel Silvestre
Development and Experimental Validation of a LoRa Wireless Sensor Network for Wildfire Surveillance. CCTA 2023: 911-917 - [c13]Daniel Silvestre
Privacy Assessment for Linear Consensus using Constrained Convex Generators. CDC 2023: 8045-8050 - [i2]Daniel Silvestre:
Exact Set-valued Estimation using Constrained Convex Generators for uncertain Linear Systems. CoRR abs/2304.04826 (2023) - 2022
- [j15]Daniel Silvestre
Reputation-Based Method to Deal With Bad Sensor Data. IEEE Control. Syst. Lett. 6: 43-48 (2022) - [j14]Daniel Silvestre
Constrained Convex Generators: A Tool Suitable for Set-Based Estimation With Range and Bearing Measurements. IEEE Control. Syst. Lett. 6: 1610-1615 (2022) - [j13]Guilherme Ramos
General resilient consensus algorithms. Int. J. Control 95(6): 1482-1496 (2022) - [j12]Daniel Silvestre
Set-valued estimators for Uncertain Linear Parameter-Varying systems. Syst. Control. Lett. 166: 105311 (2022) - [j11]Guilherme Ramos
A resilient continuous-time consensus method using a switching topology. Syst. Control. Lett. 169: 105381 (2022) - [j10]Daniel Silvestre
Fast Desynchronization Algorithms for Decentralized Medium Access Control Based on Iterative Linear Equation Solvers. IEEE Trans. Autom. Control. 67(11): 6219-6226 (2022) - [j9]Daniel Silvestre
Stochastic and Deterministic State-Dependent Social Networks. IEEE Trans. Syst. Man Cybern. Syst. 52(2): 911-926 (2022) - [c12]Daniel Silvestre
Accurate Guaranteed State Estimation for Uncertain LPVs using Constrained Convex Generators. CDC 2022: 4957-4962 - 2021
- [j8]Daniel Silvestre
Resilient Desynchronization for Decentralized Medium Access Control. IEEE Control. Syst. Lett. 5(3): 803-808 (2021) - [j7]Guilherme Ramos
Node and network resistance to bribery in multi-agent systems. Syst. Control. Lett. 147: 104842 (2021) - [i1]Guilherme Ramos, Daniel Silvestre, Carlos Silvestre:
A Discrete-time Reputation-based Resilient Consensus Algorithm for Synchronous or Asynchronous Communications. CoRR abs/2107.00431 (2021) - 2020
- [j6]He Hao
A microscopic-view Infection model based on linear systems. Inf. Sci. 510: 1-15 (2020) - [j5]Daniel Silvestre
OPTool - An optimization toolbox for iterative algorithms. SoftwareX 11: 100371 (2020) - [c11]Guilherme Ramos
A general discrete-time method to achieve resilience in consensus algorithms. CDC 2020: 2702-2707 - [c10]Rafael Ribeiro, Daniel Silvestre
A Rendezvous Algorithm for Multi-agent Systems in Disconnected Network Topologies. MED 2020: 592-597
2010 – 2019
- 2019
- [j4]Daniel Silvestre
Broadcast and Gossip Stochastic Average Consensus Algorithms in Directed Topologies. IEEE Trans. Control. Netw. Syst. 6(2): 474-486 (2019) - [c9]Daniel Silvestre
Desynchronization for Decentralized Medium Access Control based on Gauss-Seidel Iterations. ACC 2019: 4049-4054 - [c8]Daniel Silvestre
Sensitivity Analysis for Linear Systems based on Reachability Sets. CDC 2019: 361-366 - 2018
- [j3]Daniel Silvestre
Self-Triggered and Event-Triggered Set-Valued Observers. Inf. Sci. 426: 61-86 (2018) - [c7]Daniel Silvestre
A PageRank Algorithm based on Asynchronous Gauss-Seidel Iterations. ACC 2018: 484-489 - 2017
- [j2]Daniel Silvestre
Stochastic and deterministic fault detection for randomized gossip algorithms. Autom. 78: 46-60 (2017) - [j1]Daniel Silvestre
Fault detection for LPV systems using Set-Valued Observers: A coprime factorization approach. Syst. Control. Lett. 106: 32-39 (2017) - 2015
- [c6]Daniel Silvestre
Finite-time convergence policies in state-dependent social networks. ACC 2015: 1041-1046 - [c5]Daniel Silvestre
Self-Triggered Set-Valued Observers. ECC 2015: 3647-3652 - 2014
- [c4]Daniel Silvestre
Finite-time average consensus in a Byzantine environment using Set-Valued Observers. ACC 2014: 3023-3028 - 2013
- [c3]Daniel Silvestre
Gossip average consensus in a Byzantine environment using stochastic Set-Valued Observers. CDC 2013: 4373-4378 - 2011
- [c2]Duarte Antunes
Average consensus and gossip algorithms in networks with stochastic asymmetric communications. CDC/ECC 2011: 2088-2093 - 2010
- [c1]Daniel Silvestre
A Geographic Unicast Routing Algorithm Using no Location Service. NCA 2010: 280-285
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-07-20 20:35 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: