MM-ulator: Towards a Common Evaluation Platform for Mixed Mode Environments

Kropff, Matthias; Reinl, Christian; Listmann, Kim D.; Petersen, Kai; Radkhah, Katayon; Shaikh, Faisal Karim; Herzog, Arthur; Strobel, Armin; Jacobi, Daniel; Stryk, Oskar von

doi:10.1007/978-3-540-89076-8_8

“…For example, [5] and [12] use information obtained from wireless sensors for the problem of localization of a mobile robot while in [8], mobile robots and stationary sensors cooperate in a target tracking problem whereby stationary sensors track moving sensors in their sensor range and mobile agents explore regions not covered by the fixed sensors. There are also evaluation platforms for mixed-mode environments incorporating both mobile robots and wireless sensor networks, see e.g., [9]. Bike sharing systems have been installed in many cities as a low-cost and environmentally friendly transportation alternative; researchers have considered optimization problems such as placement of bike stations or rebalancing of inventory -see for example [3,11].…”

Section: Related Workmentioning

confidence: 99%

The Bike Sharing Problem

Czyzowicz

¹

,

Georgiou

²

,

Killick

³

et al. 2021

WALCOM: Algorithms and Computation

3

0

View full text Add to dashboard Cite

Assume that m ≥ 1 autonomous mobile agents and 0 ≤ b ≤ m single-agent transportation devices (called bikes) are initially placed at the left endpoint 0 of the unit interval [0, 1]. The agents are identical in capability and can move at speed one. The bikes cannot move on their own, but any agent riding bike i can move at speed vi > 1. An agent may ride at most one bike at a time. The agents can cooperate by sharing the bikes; an agent can ride a bike for a time, then drop it to be used by another agent, and possibly switch to a different bike.We study two problems. In the Bike Sharing problem, we require all agents and bikes starting at the left endpoint of the interval to reach the end of the interval as soon as possible. In the Relaxed Bike Sharing problem, we aim to minimize the arrival time of the agents; the bikes can be used to increase the average speed of the agents, but are not required to reach the end of the interval.Our main result is the construction of a polynomial time algorithm for the Bike Sharing problem that creates an arrival-time optimal schedule for travellers and bikes to travel across the interval. For the Relaxed Bike Sharing problem, we give an algorithm that gives an optimal solution for the case when at most one of the bikes can be abandoned. Keywords: Transportation • Scheduling • Cooperation • Multi agent systems • Arrival time • Optimal schedules • Robots • Resource sharing Research supported by Natural Sciences and Engineering Research Council of Canada.

show abstract

“…For example, [11] and [22] use information obtained from wireless sensors for the problem of localization of a mobile robot while in [15], mobile robots and stationary sensors cooperate in a target tracking problem whereby stationary sensors track moving sensors in their sensor range and mobile agents explore regions not covered by the fixed sensors. There are also evaluation platforms for mixed-mode environments incorporating both mobile robots and wireless sensor networks, see e.g., [18].…”

Section: Related Workmentioning

confidence: 99%

The Bike Sharing Problem

Czyzowicz¹,

Γεωργίου²,

Killick³

et al. 2020

Preprint

0

View full text Add to dashboard Cite

Assume that m ≥ 1 autonomous mobile agents and 0 ≤ b ≤ m single-agent transportation devices (called bikes) are initially placed at the left endpoint 0 of the unit interval [0, 1]. The agents are identical in capability and can move at speed one. The bikes cannot move on their own, but any agent riding bike i can move at speed vi > 1. An agent may ride at most one bike at a time. The agents can cooperate by sharing the bikes; an agent can ride a bike for a time, then drop it to be used by another agent, and possibly switch to a different bike.We study two problems. In the Bike Sharing problem, we require all agents and bikes starting at the left endpoint of the interval to reach the end of the interval as soon as possible. In the Relaxed Bike Sharing problem, we aim to minimize the arrival time of the agents; the bikes can be used to increase the average speed of the agents, but are not required to reach the end of the interval.Our main result is the construction of a polynomial time algorithm for the Bike Sharing problem that creates an arrival-time optimal schedule for travellers and bikes to travel across the interval. For the Relaxed Bike Sharing problem, we give an algorithm that gives an optimal solution for the case when at most one of the bikes can be abandoned.

show abstract

“…In [3], requirements of inter-disciplinary simulation were already discussed, benets of using multidisciplinary knowledge were presented, and road-maps for a common evaluation platform were proposed.…”

Section: Simulation and Evaluation In Mixed-mode Environmentsmentioning

confidence: 99%

“…As already proposed with MM-ulator [3], the specic benets of using simulators in a common platform open the door to systematical studies, evaluations, and development. However, the complexity of the addressed scenarios results in very complex simulators, which are usually a combination of other simulators specic for dierent research disciplines.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Simulation and Evaluation of Mixed-Mode Environments: Towards Higher Quality of Simulations

Sachidananda

¹

,

Costantini

²

,

Reinl

³

et al. 2010

Simulation, Modeling, and Programming for Autonomous Robots

Self Cite

1

0

View full text Add to dashboard Cite

Abstract. For rescue and surveillance scenarios, the Mixed-Mode Environments (MMEs) for data acquisition, processing, and dissemination have been proposed. Evaluation of the algorithms and protocols developed for such environments before deployment is vital. However, there is a lack of realistic testbeds for MMEs due to reasons such as high costs for their setup and maintenance. Hence, simulation platforms are usually the tool of choice when testing algorithms and protocols for MMEs.However, existing simulators are not able to fully support detailed evaluation of complex scenarios in MMEs. This is usually due to lack of highly accurate models for the simulated entities and environments. This aects the results which are obtained by using such simulators. In this paper, we highlight the need to consider the Quality of Simulations (QoSim), in particular aspects such as accuracy, validity, certainty, and acceptability. The focus of this paper is to understand the gap between real-world experiments and simulations for MMEs. The paper presents key QoSim concepts and characteristics for MMEs simulations, describing the aspects of contents of simulation, processing of simulation, and simulation outputs. Eventually, a road map for improving existing simulation environments is proposed.

show abstract

MM-ulator: Towards a Common Evaluation Platform for Mixed Mode Environments

Cited by 5 publications

References 18 publications

The Bike Sharing Problem

The Bike Sharing Problem

The Bike Sharing Problem

Simulation and Evaluation of Mixed-Mode Environments: Towards Higher Quality of Simulations

Contact Info

Product

Resources

About