1,116 research outputs found

    Tour recommendation for groups

    Get PDF
    Consider a group of people who are visiting a major touristic city, such as NY, Paris, or Rome. It is reasonable to assume that each member of the group has his or her own interests or preferences about places to visit, which in general may differ from those of other members. Still, people almost always want to hang out together and so the following question naturally arises: What is the best tour that the group could perform together in the city? This problem underpins several challenges, ranging from understanding people’s expected attitudes towards potential points of interest, to modeling and providing good and viable solutions. Formulating this problem is challenging because of multiple competing objectives. For example, making the entire group as happy as possible in general conflicts with the objective that no member becomes disappointed. In this paper, we address the algorithmic implications of the above problem, by providing various formulations that take into account the overall group as well as the individual satisfaction and the length of the tour. We then study the computational complexity of these formulations, we provide effective and efficient practical algorithms, and, finally, we evaluate them on datasets constructed from real city data

    Sensor Selection for Behavior Validation of Multiple Agents

    Get PDF
    Given a pre-declared itinerary of potential activities and sites for sensor placement within an environment, sensor selection involves choosing a set of sensors which can determine whether what actually occurs matches the supplied itinerary. This problem is encountered when, subject to some budget, one instruments a facility in order to ensure that the agents within behave as expected (e.g., a laboratory where the robots operating inside should follow some policy). It also applies to settings that range from surveillance and security to the design of smart spaces. We tackle a variant of the sensor selection problem where multiple agents share the same environment, which introduces some modeling subtleties, including those arising from interactions. Specifically, the multi-agent validation problem may require more than merely the union of sensors necessary for individual agents owing to aliasing: different agents may trigger sensors without those sensors necessarily being able to distinguish who was the cause. Also, the treatment of time and modeling of interleaving becomes important in providing joint itineraries, especially when combining itineraries of individuals. Since the underlying problem is NP-hard, when multiple agents are considered, another of the issues is the natural increase in size of problem instances. This paper re-formulates sensor selection as a SAT problem and introduces a graph trimming technique based on a reachability analysis. Treating the problem as a question of satisfiability is especially apt when the primary interest is in determining whether the sensors that one has available (or are within some budget to purchase) have some arrangement that suffices to validate the itinerary of interest. It also facilitates use of fast, state-of-the-art solvers. Taken together, these modifications yield significant speed-up over the previous method, as we detail in our empirical results based on simple 2-agent case studies

    Mobile-Agent Planning in a Market-Oriented Environment

    Get PDF
    We propose a method for increasing incentives for sites to host arbitrary mobile agents in which mobile agents purchase their computing needs from host sites. We present a scalable market-based CPU allocation policy and an on-line algorithm that plans a mobile agent\u27s expenditure over a multihop ordered itinerary. The algorithm chooses a set of sites at which to execute and computational priorities at each site to minimize execution time while preserving a prespecified budget constraint. We present simulation results of our algorithm to show that our allocation policy and planning algorithm scale well as more agents are added to the system

    The Portuguese Maritime Voyages of Discovery: the exploration of the history of a city with an App as an educational resource

    Get PDF
    In this paper we present an evaluation of an App for mobile devices, ‘Roteiro dos Descobrimentos’, as an educational digital resource for primary school students. The study involved the participation of 131 students and eight teachers. Data were collected from participant observation, students’ questionnaires and interviews to students and teachers. According to students, they learned new things, related with the topics explored, in an easy and funny way. Students also emphasized as positive aspects the fact that they had to face different challenges and the need to mobilize their knowledge to solve them. Teachers referred that students showed great interest and enthusiasm during the activities. As main gains, teachers stressed that the application fosters the relationship of students with the city, facilitates collaboration, and promotes students’ autonomy. In resume, it seems that the playful and interactive dimension of the App promoted the development of important skills such as the ability to interact with the environment, collaborative work, autonomy, and reading and interpretation skills. As a conclusion, there is a great receptivity to integrate mobile technologies in the teaching and learning process, but the role of the teacher can’t be dismissed, as a mediator and educator

    Computational Markets to Regulate Mobile-Agent Systems

    Get PDF
    Mobile-agent systems allow applications to distribute their resource consumption across the network. By prioritizing applications and publishing the cost of actions, it is possible for applications to achieve faster performance than in an environment where resources are evenly shared. We enforce the costs of actions through markets where user applications bid for computation from host machines. \par We represent applications as collections of mobile agents and introduce a distributed mechanism for allocating general computational priority to mobile agents. We derive a bidding strategy for an agent that plans expenditures given a budget and a series of tasks to complete. We also show that a unique Nash equilibrium exists between the agents under our allocation policy. We present simulation results to show that the use of our resource-allocation mechanism and expenditure-planning algorithm results in shorter mean job completion times compared to traditional mobile-agent resource allocation. We also observe that our resource-allocation policy adapts favorably to allocate overloaded resources to higher priority agents, and that agents are able to effectively plan expenditures even when faced with network delay and job-size estimation error

    The Merits of Sharing a Ride

    Full text link
    The culture of sharing instead of ownership is sharply increasing in individuals behaviors. Particularly in transportation, concepts of sharing a ride in either carpooling or ridesharing have been recently adopted. An efficient optimization approach to match passengers in real-time is the core of any ridesharing system. In this paper, we model ridesharing as an online matching problem on general graphs such that passengers do not drive private cars and use shared taxis. We propose an optimization algorithm to solve it. The outlined algorithm calculates the optimal waiting time when a passenger arrives. This leads to a matching with minimal overall overheads while maximizing the number of partnerships. To evaluate the behavior of our algorithm, we used NYC taxi real-life data set. Results represent a substantial reduction in overall overheads

    Crowdsensing-driven route optimisation algorithms for smart urban mobility

    Get PDF
    Urban rörlighet anses ofta vara en av de främsta möjliggörarna för en hållbar statsutveckling. Idag skulle det dock kräva ett betydande skifte mot renare och effektivare stadstransporter vilket skulle stödja ökad social och ekonomisk koncentration av resurser i städerna. En viktig prioritet för städer runt om i världen är att stödja medborgarnas rörlighet inom stadsmiljöer medan samtidigt minska trafikstockningar, olyckor och föroreningar. Att utveckla en effektivare och grönare (eller med ett ord; smartare) stadsrörlighet är en av de svåraste problemen att bemöta för stora metropoler. I denna avhandling närmar vi oss problemet från det snabba utvecklingsperspektivet av ITlandskapet i städer vilket möjliggör byggandet av rörlighetslösningar utan stora stora investeringar eller sofistikerad sensortenkik. I synnerhet föreslår vi utnyttjandet av den mobila rörlighetsavkännings, eng. Mobile Crowdsensing (MCS), paradigmen i vilken befolkningen exploaterar sin mobilkommunikation och/eller mobilasensorer med syftet att frivilligt samla, distribuera, lokalt processera och analysera geospecifik information. Rörlighetavkänningssdata (t.ex. händelser, trafikintensitet, buller och luftföroreningar etc.) inhämtad från frivilliga i befolkningen kan ge värdefull information om aktuella rörelsesförhållanden i stad vilka, med adekvata databehandlingsalgoriter, kan användas för att planera människors rörelseflöden inom stadsmiljön. Såtillvida kombineras i denna avhandling två mycket lovande smarta rörlighetsmöjliggörare, eng. Smart Mobility Enablers, nämligen MCS och rese/ruttplanering. Vi kan därmed till viss utsträckning sammanföra forskningsutmaningar från dessa två delar. Vi väljer att separera våra forskningsmål i två delar, dvs forskningssteg: (1) arkitektoniska utmaningar vid design av MCS-system och (2) algoritmiska utmaningar för tillämpningar av MCS-driven ruttplanering. Vi ämnar att visa en logisk forskningsprogression över tiden, med avstamp i mänskligt dirigerade rörelseavkänningssystem som MCS och ett avslut i automatiserade ruttoptimeringsalgoritmer skräddarsydda för specifika MCS-applikationer. Även om vi förlitar oss på heuristiska lösningar och algoritmer för NP-svåra ruttproblem förlitar vi oss på äkta applikationer med syftet att visa på fördelarna med algoritm- och infrastrukturförslagen.La movilidad urbana es considerada una de las principales desencadenantes de un desarrollo urbano sostenible. Sin embargo, hoy en día se requiere una transición hacia un transporte urbano más limpio y más eficiente que soporte una concentración de recursos sociales y económicos cada vez mayor en las ciudades. Una de las principales prioridades para las ciudades de todo el mundo es facilitar la movilidad de los ciudadanos dentro de los entornos urbanos, al mismo tiempo que se reduce la congestión, los accidentes y la contaminación. Sin embargo, desarrollar una movilidad urbana más eficiente y más verde (o en una palabra, más inteligente) es uno de los temas más difíciles de afrontar para las grandes áreas metropolitanas. En esta tesis, abordamos este problema desde la perspectiva de un panorama TIC en rápida evolución que nos permite construir movilidad sin la necesidad de grandes inversiones ni sofisticadas tecnologías de sensores. En particular, proponemos aprovechar el paradigma Mobile Crowdsensing (MCS) en el que los ciudadanos utilizan sus teléfonos móviles y dispositivos, para nosotros recopilar, procesar y analizar localmente información georreferenciada, distribuida voluntariamente. Los datos de movilidad recopilados de ciudadanos que voluntariamente quieren compartirlos (por ejemplo, eventos, intensidad del tráfico, ruido y contaminación del aire, etc.) pueden proporcionar información valiosa sobre las condiciones de movilidad actuales en la ciudad, que con el algoritmo de procesamiento de datos adecuado, pueden utilizarse para enrutar y gestionar el flujo de gente en entornos urbanos. Por lo tanto, en esta tesis combinamos dos prometedoras fuentes de movilidad inteligente: MCS y la planificación de viajes/rutas, uniendo en cierta medida los distintos desafíos de investigación. Hemos dividido nuestros objetivos de investigación en dos etapas: (1) Desafíos arquitectónicos en el diseño de sistemas MCS y (2) Desafíos algorítmicos en la planificación de rutas aprovechando la información del MCS. Nuestro objetivo es demostrar una progresión lógica de la investigación a lo largo del tiempo, comenzando desde los fundamentos de los sistemas de detección centrados en personas, como el MCS, hasta los algoritmos de optimización de rutas diseñados específicamente para la aplicación de estos. Si bien nos centramos en algoritmos y heurísticas para resolver problemas de enrutamiento de clase NP-hard, utilizamos ejemplos de aplicaciones en el mundo real para mostrar las ventajas de los algoritmos e infraestructuras propuestas

    The Value of Optimization in Dynamic Ride-Sharing: a Simulation Study in Metro Atlanta

    Get PDF
    Smartphone technology enables dynamic ride-sharing systems that bring together people with similar itineraries and time schedules to share rides on short-notice. This paper considers the problem of matching drivers and riders in this dynamic setting. We develop optimization-based approaches that aim at minimizing the total system-wide vehicle miles and individual travel costs. To assess the merits of our methods we present a simulation study based on 2008 travel demand data from metropolitan Atlanta. The simulation results indicate that the use of sophisticated optimization methods instead of simple greedy matching rules may substantially improve the performance of ride-sharing systems. Furthermore, even with relatively low participation rates, it appears that sustainable populations of dynamic ride-sharing participants may be possible even in relatively sprawling urban areas with many employment centers

    A Framework for Enhancing the Operational Phase of Traffic Management Plans

    Get PDF
    Road traffic emergencies are dangerous and unexpected situations that require immediate actions by the authorities. These actions involve to attend to the people who have been affected by the emergency and to minimize its consequences. A Traffic Management Plan (TMP) is a set of pre-defined measures and actions designed to produce an effective and efficient use of available resources in order to deal with a specific road incident. The operational phase of a TMP involves the coordination of several independent agencies (road managers, traffic police, firemen, etc.). These agencies must provide the resources required by the TMP in the deployment of the measures and actions. In this paper, a new framework to support the TMP operational phase is presented. This framework models each agency as an intelligent agent and it uses a reverse combinatorial distributed auction as the core component of a negotiation process. The goal of this negotiation process is to obtain a common agreement on the best possible allocation of resources taking into account the role, competencies and interest of the involved agencies. The framework has been implemented in a real scenario with real data. The tests developed have demonstrated that the system is able to manage the resources in terms of the execution time and the quality of the provided solutions
    corecore