Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Martin Nilsson 0001

dblp:19/583 · DBLP profile ↗
← Back
13ranked-venue papers
9as first author
0since 2021 · last 2010
0000-0002-7504-0328ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 7 · 6 first-authorSystems, architecture and hardware · 6 · 5 first-authorComputer networks · 2Software engineering, systems software and programming languages · 2 · 2 first-authorTheory of computation · 2 · 2 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 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.

Computer networks
3 papers
Physical-layer communications · 62% Wireless networking · 34% Network measurement and analytics · 2%
Artificial intelligence
4 papers
Robot manipulation · 66% Legged, aerial and field robots · 28% Motion planning and robot control · 4%
Computer architecture, parallel and distributed computing, and storage systems
2 papers
Energy-efficient computing · 57% Emerging computing paradigms · 43%

Topics — the 12 heaviest of 15, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › antenna systems
antenna
0.112010
Smart antennas made practical: the SPIDA way · IPSN 2010
Wireless networking
directional antenna
0.112010
Smart antennas made practical: the SPIDA way · IPSN 2010
Physical-layer communications › antenna arrays
smart antennas
0.112010
Smart antennas made practical: the SPIDA way · IPSN 2010
Robotics › Legged, aerial and field robots › bio-inspired robot
snake robot
0.021998
Why Snake Robots Need Torsion-Free Joints and How to Design Them · ICRA 1998
Snake robot free climbing · ICRA 1997
Robotics › Robot manipulation
modular robot
0.012002
Heavy-Duty Connectors for Self-Reconfiguring Robots · ICRA 2002
Robotics › Robot manipulation › modular robot
self-reconfigurable robots
0.012002
Heavy-Duty Connectors for Self-Reconfiguring Robots · ICRA 2002
Physical-layer communications
beamforming
0.012010
Smart antennas made practical: the SPIDA way · IPSN 2010
Wireless networking
mobile ad hoc networks
0.012001
Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment · INFOCOM 2001
Emerging computing paradigms
approximate and stochastic computing
0.011999
Tactile Sensing with Minimal Wiring Complexity · ICRA 1999
Robotics › Robot manipulation
mechanical design
0.022002
Heavy-Duty Connectors for Self-Reconfiguring Robots · ICRA 2002
Why Snake Robots Need Torsion-Free Joints and How to Design Them · ICRA 1998
Network measurement and analytics
workload characterization
0.012001
Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment · INFOCOM 2001
Robotics › Motion planning and robot control
robot control
0.011997
Snake robot free climbing · ICRA 1997

Methods — techniques the papers use, named apart from their topics

linear regression · 0.1experimental measurement · 0.1impulse response analysis · 0.0self-alignment · 0.0latching mechanism · 0.0prototype testing · 0.0pitch-roll joint design · 0.0dynamic torque analysis · 0.0algorithm design · 0.0
YearPublicationVenuePosition
2010 Smart antennas made practical: the SPIDA way
abstract
Smart antennas are a specific type of directional antenna able to dynamically control the gain as a function of direction. This contrasts with more traditional directional antennas, where the dynamic ability is missing, and with omnidirectional antennas, which are designed to have equal gain in all directions.
Erik Öström, Luca Mottola, Martin Nilsson 0001, Thiemo Voigt
IPSN3
2010 Measuring available path capacity using short probe trains
abstract
It is well known that algorithms for measuring available path capacity at the IP layer by active probing tend to be more accurate when using long probe trains. This is due to the bias errors introduced by short probe trains. However, long trains have other disadvantages, such as delay, overhead, and increased risk for packet loss, especially for high probe rates. Router queue sizes also limit the maximum probe train length. In this paper, a robust method is proposed for reducing measurement bias caused by short probe trains. The method is robust in the sense that it gracefully handles lost packets and outliers, such as caused by non-Poisson cross traffic. The proposed method has been combined with the BART estimator for measuring available path capacity, and successfully tested in a multi-hop local IP network for industrial use. The principle should be generally applicable to estimators of available path capacity based on active probe trains.
Martin Nilsson 0001
NOMS1
2006 Real-Time Measurement of End-to-End Available Bandwidth using Kalman Filtering
abstract
This paper presents a new method, BART (bandwidth available in real-time), for estimating the end-to-end available bandwidth over a network path. It estimates bandwidth quasi-continuously, in real-time. The method has also been implemented as a tool. It relies on self-induced congestion, and repeatedly samples the available bandwidth of the network path with sequences of probe packet pairs, sent at randomized rates. BART requires little computation in each iteration, is lightweight with respect to memory requirements, and adds only a small amount of probe traffic. The BART method uses Kalman filtering, which enables real-time estimation (a.k.a. tracking). It maintains a current estimate, which is incrementally improved with each new measurement of the inter-packet time separations in a sequence of probe packet pairs. The measurement model has a strong non-linearity, and would not at first sight be considered suitable for Kalman filtering, but we show how this non-linearity can be handled. BART may be tuned according to the specific needs of the measurement application, such as agility vs. stability of the estimate. We have tested an implementation of BART in a physical test network with carefully controlled cross traffic, with good accuracy and agreement. Test measurements have also been performed over the Internet. We compare the performance of BART with that of pathChirp, a state-of-the-art tool for measuring end-to-end available bandwidth in real-time
Svante Ekelin, Martin Nilsson 0001, Erik Hartikainen, Andreas Johnsson, Jan-Erik Mångs, Bob Melander, Mats Björkman
NOMS2
2004 Serpentine locomotion on surfaces with uniform friction
abstract
A common view in snake robot research is that serpentine locomotion is only possible when there is nonuniform friction. This paper demonstrates that this view is incorrect, through a simple and easily reproducible experiment. We also present a theoretical kinematical analysis, which explains the experiment.
Martin Nilsson 0001
IROS1
2002 Heavy-Duty Connectors for Self-Reconfiguring Robots
abstract
Connectors for self-reconfiguring robots need to fulfill a wide range of requirements. We discuss these properties, with emphasis on geometrical shape and latching. We describe the DRAGON modular connector, whose most distinctive features are its ability to self-align and its strength. It weighs 170 g, but holds over 70 kg load. It is able to self-align /spl plusmn/15 mm (O/5) lateral offsets, and /spl plusmn/45/spl deg/ directional and rotational offsets.
Martin Nilsson 0001
ICRA1
2001 Investigating the Energy Consumption of a Wireless Network Interface in an Ad Hoc Networking Environment
abstract
Energy-aware design and evaluation of network protocols requires knowledge of the energy consumption behavior of actual wireless interfaces. But little practical information is available about the energy consumption behavior of well-known wireless network interfaces and device specifications do not provide information in a form that is helpful to protocol developers. This paper describes a series of experiments which obtained detailed measurements of the energy consumption of an IEEE 802.11 wireless network interface operating in an ad hoc networking environment. The data is presented as a collection of linear equations for calculating the energy consumed in sending, receiving and discarding broadcast and point-to-point data packets of various sizes. Some implications for protocol design and evaluation in ad hoc networks are discussed.
Laura Marie Feeney, Martin Nilsson 0001
INFOCOM2
1999 Tactile Sensing with Minimal Wiring Complexity
abstract
We describe a principle for tactile sensing which allows acquisition of data from a sensor array using a single wire. The basic idea is to construct the sensor array as a filter. Sensor excitation changes filter characteristics, and can be recovered through the filter's impulse response. The method is also applicable to distributed sensor arrays of other scalar fields than mechanical pressure, such as heat, proximity, or radiation. We discuss the general principle, together with theoretical analysis and experimental data for a particular design.
Martin Nilsson 0001
ICRA1
1998 Why Snake Robots Need Torsion-Free Joints and How to Design Them
abstract
In order to perform operations such as slip-free locomotion and vertical climbing, autonomous snake robots need joints with special properties. The most important of these are their being torsion-free, and having large pitch range. We discuss these requirements, and derive an actuated, torsion-free joint design which combines a /spl plusmn/135/spl deg/ pitch range with an unlimited roll range. The joint has been built and tested, and some data are given for a prototype, employed in an experimental snake robot.
Martin Nilsson 0001
ICRA1
1997 Snake robot free climbing
abstract
Autonomous snake robot locomotion in rough terrain depends on the robot's ability to rise from a horizontal position to a vertical. At first sight, lifting N body segments seems to require O(N) dynamic torque. However, in this paper we describe a practical algorithm, which requires only O(1) dynamic torque. The algorithm is applicable to a wide range of snake robot morphologies. The algorithm requires little space, and control is simple, since motion occurs only in a plane. Analysis of the algorithm reveals a strong relation between the maximum dynamic torque required and the joint pitch range. We discuss some consequences for the design of snake robots. For instance, we show that an adjustment of the mass center of the robot's end segment can reduce the maximum dynamic torque. We study the implications for some snake robot joint designs, including Dragon I, an autonomous snake robot constructed for the study of unconventional locomotion.
Martin Nilsson 0001
ICRA1
1995 Cooperative multi-robot box-pushing
abstract
This paper deals with the communication in task-sharing between two autonomous six-legged robots equipped with object and goal sensing, and a repertoire of contact and light-following behaviors. The performance of pushing an elongated box towards a goal region is difficult for a single robot and improves significantly when performed cooperatively, but requires careful coordination between the robots. We present and experimentally demonstrate an approach that utilizes cooperation at three levels: sensing, action, and control, and takes the advantage of a simple communication protocol to compensate for the robots' noisy and uncertain sensing.
Maja J. Mataric, Martin Nilsson 0001, Kristian T. Simsarin
IROS (3)2
1986 Cyclic Tree Traversal
Martin Nilsson 0001, Hidehiko Tanaka
ICLP1
1984 Prolog as a Tool for Optimizing Prolog Unifiers
Martin Nilsson 0001
ICLP1
1983 A Logical Model of Knowledge
Martin Nilsson 0001
IJCAI1