158 research outputs found

    A stigmergy-based analysis of city hotspots to discover trends and anomalies in urban transportation usage

    Full text link
    A key aspect of a sustainable urban transportation system is the effectiveness of transportation policies. To be effective, a policy has to consider a broad range of elements, such as pollution emission, traffic flow, and human mobility. Due to the complexity and variability of these elements in the urban area, to produce effective policies remains a very challenging task. With the introduction of the smart city paradigm, a widely available amount of data can be generated in the urban spaces. Such data can be a fundamental source of knowledge to improve policies because they can reflect the sustainability issues underlying the city. In this context, we propose an approach to exploit urban positioning data based on stigmergy, a bio-inspired mechanism providing scalar and temporal aggregation of samples. By employing stigmergy, samples in proximity with each other are aggregated into a functional structure called trail. The trail summarizes relevant dynamics in data and allows matching them, providing a measure of their similarity. Moreover, this mechanism can be specialized to unfold specific dynamics. Specifically, we identify high-density urban areas (i.e hotspots), analyze their activity over time, and unfold anomalies. Moreover, by matching activity patterns, a continuous measure of the dissimilarity with respect to the typical activity pattern is provided. This measure can be used by policy makers to evaluate the effect of policies and change them dynamically. As a case study, we analyze taxi trip data gathered in Manhattan from 2013 to 2015.Comment: Preprin

    Swarm Relays: Distributed Self-Healing Ground-and-Air Connectivity Chains

    Full text link
    The coordination of robot swarms - large decentralized teams of robots - generally relies on robust and efficient inter-robot communication. Maintaining communication between robots is particularly challenging in field deployments. Unstructured environments, limited computational resources, low bandwidth, and robot failures all contribute to the complexity of connectivity maintenance. In this paper, we propose a novel lightweight algorithm to navigate a group of robots in complex environments while maintaining connectivity by building a chain of robots. The algorithm is robust to single robot failures and can heal broken communication links. The algorithm works in 3D environments: when a region is unreachable by wheeled robots, the chain is extended with flying robots. We test the performance of the algorithm using up to 100 robots in a physics-based simulator with three mazes and different robot failure scenarios. We then validate the algorithm with physical platforms: 7 wheeled robots and 6 flying ones, in homogeneous and heterogeneous scenarios.Comment: 9 pages, 8 figures, Accepted for publication in Robotics and Automation Letters (RAL

    Emerging robot swarm traffic

    Get PDF
    We discuss traffic patterns generated by swarms of robots while commuting to and from a base station. The overall question is whether to explicitly organise the traffic or whether a certain regularity develops `naturally'. Human driven motorized traffic is rigidly structured in two lanes. However, army ants develop a three-lane pattern in their traffic, while human pedestrians generate a main trail and secondary trials in either direction. Our robot swarm approach is bottom-up: designing individual agents we first investigate the mathematics of cases occurring when applying the artificial potential field method to three 'perfect' robots. We show that traffic lane pattern will not be disturbed by the internal system of forces. Next, we define models of sensor designs to account for the practical fact that robots (and ants) have limited visibility and compare the sensor models in groups of three robots. In the final step we define layouts of a highway: an unbounded open space, a trail with surpassable edges and a hard defined (walled) highway. Having defined the preliminaries we run swarm simulations and look for emerging traffic patterns. Apparently, depending on the initial situation a variety of lane patterns occurs, however, high traffic densities do delay the emergence of traffic lanes considerably. Overall we conclude that regularities do emerge naturally and can be turned into an advantage to obtain efficient robot traffic

    Distributed Swarm Formation Using Mobile Agents

    Get PDF
    This chapter presents decentralized control algorithms for composing formations of swarm robots. The robots are connected by communication networks. They initially do not have control program to compose formations. Control programs that implement our algorithm are introduced later from outside as mobile software agents. Our controlling algorithm is based on the pheromone communication of social insects such as ants. We have implemented the ant and the pheromone as mobile software agents. Ant agents control the robots. Each ant agent has partial information about the formation it is supposed to compose. The partial information consists of relative locations with neighbor robots that are cooperatively composing the formation. Once the ant agent detects an idle robot, it occupies that robot and generates the pheromone agent to attract other ant agents to the location for neighbor robots. Then the pheromone agent repeatedly migrates to other robots to diffuse attracting information. Once the pheromone agent reaches the robot with an ant agent, the ant agent migrates to the robot closest to the location pointed by the pheromone agent and then drives the robot to the location. We have implemented simulators based on our algorithm and conducted experiments to demonstrate the feasibility of our approach

    Analysis and Comparison of Clothoid and Dubins Algorithms for UAV Trajectory Generation

    Get PDF
    The differences between two types of pose-based UAV path generation methods clothoid and Dubins are analyzed in this thesis. The Dubins path is a combination of circular arcs and straight line segments; therefore its curvature will exhibit sudden jumps between constant values. The resulting path will have a minimum length if turns are performed at the minimum possible turn radius. The clothoid path consists of a similar combination of arcs and segments but the difference is that the clothoid arcs have a linearly variable curvature and are generated based on Fresnel integrals. Geometrically, the generation of the clothoid arc starts with a large curvature that decreases to zero. The clothoid path results are longer than the Dubins path between the same two poses and for the same minimum turn radius. These two algorithms are the focus of this research because of their geometrical simplicity, flexibility, and low computational requirements.;The comparison between clothoid and Dubins algorithms relies on extensive simulation results collected using an ad-hoc developed automated data acquisition tool within the WVU UAV simulation environment. The model of a small jet engine UAV has been used for this purpose. The experimental design considers several primary factors, such as different trajectory tracking control laws, normal and abnormal flight conditions, relative configuration of poses, and wind and turbulence. A total of five different controllers have been considered, three conventional with fixed parameters and two adaptive. The abnormal flight conditions include locked or damaged actuators (stabilator, aileron, or rudder) and sensor bias affecting roll, pitch, or yaw rate gyros that are used in the feedback control loop. The relative configuration of consecutive poses is considered in terms of heading (required turn angle) and relative location of start and end points (position quadrant). Wind and turbulence effects were analyzed for different wind speed and direction and several levels of turbulence severity. The evaluation and comparison of the two path generation algorithms are performed based on generated and actual path length and tracking performance assessed in terms of tracking errors and control activity.;Although continuous position and velocity are ensured, the Dubins path yields discontinuous changes in path curvature and hence in commanded lateral accelerations at the transition points between the circular arcs and straight segments. The simulation results show that this generally leads to increased trajectory tracking errors, longer actual paths, and more intense control surface activity. The gradual (linear) change in clothoid curvature yields a continuous change in commanded lateral accelerations with general positive effects on the overall UAV performance based on the metrics considered. The simulation results show general similar trends for all factors considered. As a result, it may be concluded that, due to the continuous change in commanded lateral acceleration, the clothoid path generation algorithm provides overall better performance than the Dubins algorithm, at both normal and abnormal flight conditions, if the UAV mission involves significant maneuvers requiring intense lateral acceleration commands

    A general architecture for robotic swarms

    Get PDF
    Swarms are large groups of simplistic individuals that collectively solve disproportionately complex tasks. Individual swarm agents are limited in perception, mechanically simple, have no global knowledge and are cheap, disposable and fallible. They rely exclusively on local observations and local communications. A swarm has no centralised control. These features are typifed by eusocial insects such as ants and termites, who construct nests, forage and build complex societies comprised of primitive agents. This project created the basis of a general swarm architecture for the control of insect-like robots. The Swarm Architecture is inspired by threshold models of insect behaviour and attempts to capture the salient features of the hive in a closely defined computer program that is hardware agnostic, swarm size indifferent and intended to be applicable to a wide range of swarm tasks. This was achieved by exploiting the inherent limitations of swarm agents. Individual insects were modelled as a machine capable only of perception, locomotion and manipulation. This approximation reduced behaviour primitives to a fixed tractable number and abstracted sensor interpretation. Cooperation was achieved through stigmergy and decisions made via a behaviour threshold model. The Architecture represents an advance on previous robotic swarms in its generality - swarm control software has often been tied to one task and robot configuration. The Architecture's exclusive focus on swarms, sets it apart from existing general cooperative systems, which are not usually explicitly swarm orientated. The Architecture was implemented successfully on both simulated and real-world swarms
    corecore