Demo Data from SIGIR 2026 / reviewers in the wild / expert
Nuno C. Martins
dblp:78/2121
· DBLP profile ↗
4ranked-venue papers
1as first author
0since 2021 · last 2013
0000-0003-2083-8102ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2Systems, architecture and hardware · 2Theory of computation · 2 · 1 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
2 papers |
Legged, aerial and field robots · 46% Multi-agent systems · 46% Reinforcement learning · 7% | |
| Theoretical computer science
1 paper |
Coding theory · 50% Information theory · 50% | |
| Computer networks
1 paper |
Internet of things and sensor networks · 50% Wireless sensing and localization · 50% |
Topics — the 11 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Knowledge, reasoning and agents › Multi-agent systems
distributed control |
0.2 | 1 | 2013 | TinyTeRP: A Tiny Terrestrial Robotic Platform with modular sensing · ICRA 2013 |
Robotics › Legged, aerial and field robots
miniature robot |
0.2 | 1 | 2013 | TinyTeRP: A Tiny Terrestrial Robotic Platform with modular sensing · ICRA 2013 |
Knowledge, reasoning and agents › Multi-agent systems
multi-robot systems |
0.2 | 1 | 2013 | TinyTeRP: A Tiny Terrestrial Robotic Platform with modular sensing · ICRA 2013 |
Robotics › Legged, aerial and field robots
persistent surveillance |
0.2 | 1 | 2013 | Maximal persistent surveillance under safety constraints · ICRA 2013 |
Information theory
channel capacity |
0.1 | 1 | 2008 | Coding for Additive White Noise Channels With Feedback Corrupted by Quantization or Bounded Noise · IEEE Trans. Inf. Theory 2008 |
Coding theory
channel coding |
0.1 | 1 | 2008 | Coding for Additive White Noise Channels With Feedback Corrupted by Quantization or Bounded Noise · IEEE Trans. Inf. Theory 2008 |
Coding theory › channel coding › feedback communication
feedback coding |
0.1 | 1 | 2008 | Coding for Additive White Noise Channels With Feedback Corrupted by Quantization or Bounded Noise · IEEE Trans. Inf. Theory 2008 |
Information theory › channel capacity
gaussian channel |
0.1 | 1 | 2008 | Coding for Additive White Noise Channels With Feedback Corrupted by Quantization or Bounded Noise · IEEE Trans. Inf. Theory 2008 |
Machine learning › Reinforcement learning
markov decision process |
0.0 | 1 | 2013 | Maximal persistent surveillance under safety constraints · ICRA 2013 |
Wireless sensing and localization
RF sensing |
0.0 | 1 | 2013 | TinyTeRP: A Tiny Terrestrial Robotic Platform with modular sensing · ICRA 2013 |
Internet of things and sensor networks
wireless sensor network |
0.0 | 1 | 2013 | TinyTeRP: A Tiny Terrestrial Robotic Platform with modular sensing · ICRA 2013 |
Methods — techniques the papers use, named apart from their topics
RSSI · 0.3802.15.4 radio · 0.3entropy maximization · 0.2convex programming · 0.2controlled markov chain · 0.2schalkwijk-kailath scheme · 0.1error exponent analysis · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2013 | Maximal persistent surveillance under safety constraintsabstractThis paper presents a method for the design of time-invariant memoryless control policies for robots tasked with persistent surveillance of an area in which there are forbidden regions. We model each robot as a controlled Markov chain whose state comprises its position on a finite two-dimensional lattice and the direction of motion. The goal is to find the minimum number of robots and an associated time-invariant memoryless control policy that guarantees that the largest number of states are persistently surveilled without ever visiting a forbidden state. We propose a design method that relies on a finitely parametrized convex program inspired by entropy maximization principles. For clarity of exposition, we focus on simple dynamics and state/control spaces, however the proposed methodology can be extended to more general cases. Numerical examples are provided. Eduardo Arvelo, Eric Kim, Nuno C. Martins |
ICRA | 3 |
| 2013 | TinyTeRP: A Tiny Terrestrial Robotic Platform with modular sensingabstractThe TinyTeRP is a small, low-cost, modular robotics platform used to study robot sensing and control in large numbers of miniature robots. A fully assembled TinyTeRP costs approximately $50, is 1.7 × 1.8 × 2 cm3, and can move at speeds up to 50 cm/s. The robot is designed around a wheeled platform onto which different circuit boards can be stacked providing hardware modularity. The base module integrates a microcontroller with an 802.15.4 radio used for both sensing and communication between robots. An inertial sensing module used to improve single robot control is provided as an example of an additional sensing board. A simple `rendezvous' algorithm using received signal strength indicator (RSSI) data from the radio illustrates a distributed control algorithm with the TinyTeRP. Andrew P. Sabelhaus, Daniel Mirsky, Maxwell Hill, Nuno C. Martins, Sarah Bergbreiter |
ICRA | 4 |
| 2008 | Optimal state estimation for discrete-time Markovian Jump Linear Systems, in the presence of delayed output observationsabstractIn this paper, we investigate the design of optimal state estimators for Markovian jump linear systems. We consider that the state has two components: the first component is finite valued and is denoted as mode, while the second (continuous) component is in a finite dimensional Euclidean space. The continuous state is driven by a zero mean, white and Gaussian process noise. The observation output has two components: the first is the mode and the second is a linear combination of the continuous state observed and zero mean, white Gaussian noise. Both output components are affected by delays, not necessarily equal. Our paradigm is to design optimal estimators for the current state, given the current output observation. We provide a solution to this paradigm by giving a recursive estimator for the continuous state, in the minimum mean square sense, and a finitely parameterized recursive scheme for computing the probability mass function of the current mode conditioned on the observed output. We show that when the mode is observed with a greater delay then the continuous output component, the optimal estimator nonlinear in the observed outputs. Ion Matei, Nuno C. Martins, John S. Baras |
ITW | 2 |
| 2008 | Coding for Additive White Noise Channels With Feedback Corrupted by Quantization or Bounded NoiseabstractWe present coding strategies, which are variants of the Schalkwijk-Kailath scheme, for communicating reliably over additive white noise channels in the presence of corrupted feedback. Our framework comprises an additive white forward channel and a feedback link. We consider two types of corruption mechanisms in the feedback link. The first is quantization noise, i.e., the encoder receives the quantized values of the past outputs of the forward channel. The quantization is uniform, memoryless and time invariant. The second corruption mechanism is an arbitrarily distributed additive bounded noise. Here we allow symbol-by-symbol encoding at the input to the feedback link. We propose explicit schemes featuring positive information rate and positive error exponent. If the forward channel is additive white Gaussian (AWGN) then, as the amplitude of the noise at the feedback link decreases to zero, the rate of our schemes converges to the capacity of the channel. Moreover, the probability of error is shown to converge to zero at a doubly exponential rate. If the forward channel is AWGN and the feedback link consists of an additive bounded noise channel, with signal-to-noise ratio (SNR) constrained symbol-by-symbol encoding, then our schemes achieve rates arbitrarily close to capacity, in the limit of high SNR (at the feedback link). Nuno C. Martins, Tsachy Weissman |
IEEE Trans. Inf. Theory | 1 |