3,728 research outputs found

    Dynamic Arrival Rate Estimation for Campus Mobility on Demand Network Graphs

    Full text link
    Mobility On Demand (MOD) systems are revolutionizing transportation in urban settings by improving vehicle utilization and reducing parking congestion. A key factor in the success of an MOD system is the ability to measure and respond to real-time customer arrival data. Real time traffic arrival rate data is traditionally difficult to obtain due to the need to install fixed sensors throughout the MOD network. This paper presents a framework for measuring pedestrian traffic arrival rates using sensors onboard the vehicles that make up the MOD fleet. A novel distributed fusion algorithm is presented which combines onboard LIDAR and camera sensor measurements to detect trajectories of pedestrians with a 90% detection hit rate with 1.5 false positives per minute. A novel moving observer method is introduced to estimate pedestrian arrival rates from pedestrian trajectories collected from mobile sensors. The moving observer method is evaluated in both simulation and hardware and is shown to achieve arrival rate estimates comparable to those that would be obtained with multiple stationary sensors.Comment: Appears in 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS). http://ieeexplore.ieee.org/abstract/document/7759357

    Duke University Health System Demand Response Prospectus

    Get PDF
    The Duke University Health System Demand Response Prospectus is a client-based Masters Project that explores the profitability and environmental impacts of enrolling Duke University Health System and Duke University into Duke Energy’s PowerShare demand response program. Demand response programs are mechanisms used by utilities to decrease energy demand during high-usage periods (e.g. hot days when air conditioning use is highest) by incentivizing their customers to reduce grid consumption for a limited time. This temporary demand reduction results in cost savings to utilities because it allows them to avoid using their most inefficient and expensive power plants. In our project, we analyze the economic, environmental, and regulatory feasibility of using Duke University and Duke Medicine emergency generators in a Duke Energy demand response program called PowerShare, more specifically the Generator Curtailment Option. Duke Carbon Offset Initiative credits, a Duke University funding mechanism to reduce carbon dioxide emissions, were also considered as a potential revenue source. In order to conduct the analysis, an MS Excel and Visual Basic model was created to calculate the impacts of enrollment. The model provided to the client was designed to offer an easy user interface to quickly conduct the analyses. It was also specially designed to offer the flexibility to incorporate future changes in the energy market and user preferences. The model results indicated that, while feasible, demand response enrollment is not currently attractive from environmental and financial perspectives. The financials are poor for two mains reasons. First, expected net revenues are strictly negative because PowerShare enrollment requires Duke University to re-enroll into paying a demand side management rider (DSM) to which they are currently exempt. The DSM fee, although minimal individually, amounts to an astronomical fee for large consumers like Duke University and Duke Medicine since it is charged per unit of energy purchased. Second, PowerShare curtailment compensation is lower than current cost of diesel fuel. From an environmental perspective, PowerShare is also not a favorable option. Instead of offering a carbon emissions reduction opportunity, PowerShare participation is actually expected to increase the amount of global carbon emissions because Duke University generators emit more carbon than Duke Energy’s natural gas peak usage plants

    Social media is weakening passwords

    Get PDF
    Passwords are often generated from readily available information such as family names and memorable events. However, people put the same readily available information on social media often times making it available to the general public. We propose an experiment to empirically validate the previous premise as well as develop an algorithm to generate passwords based off participant’s Facebook public information

    More Than a Feeling: Learning to Grasp and Regrasp using Vision and Touch

    Full text link
    For humans, the process of grasping an object relies heavily on rich tactile feedback. Most recent robotic grasping work, however, has been based only on visual input, and thus cannot easily benefit from feedback after initiating contact. In this paper, we investigate how a robot can learn to use tactile information to iteratively and efficiently adjust its grasp. To this end, we propose an end-to-end action-conditional model that learns regrasping policies from raw visuo-tactile data. This model -- a deep, multimodal convolutional network -- predicts the outcome of a candidate grasp adjustment, and then executes a grasp by iteratively selecting the most promising actions. Our approach requires neither calibration of the tactile sensors, nor any analytical modeling of contact forces, thus reducing the engineering effort required to obtain efficient grasping policies. We train our model with data from about 6,450 grasping trials on a two-finger gripper equipped with GelSight high-resolution tactile sensors on each finger. Across extensive experiments, our approach outperforms a variety of baselines at (i) estimating grasp adjustment outcomes, (ii) selecting efficient grasp adjustments for quick grasping, and (iii) reducing the amount of force applied at the fingers, while maintaining competitive performance. Finally, we study the choices made by our model and show that it has successfully acquired useful and interpretable grasping behaviors.Comment: 8 pages. Published on IEEE Robotics and Automation Letters (RAL). Website: https://sites.google.com/view/more-than-a-feelin

    Reusing Data and Metadata to Create New Metadata Through Machine-Learning & Other Programmatic Methods

    Get PDF
    Recent improvements in natural language processing (NLP) enable metadata to be created programmatically from reused original metadata or even the dataset itself. Transfer-learning applied to NLP has greatly improved performance and reduced training data requirements. In this talk, well compare machine-generated metadata to human-generated metadata and discuss characteristics of metadata and data archives that affect suitability for machine-learning reuse of metadata. Where as human-generated metadata is often populated once, populated from the perspective of data supplier, populated by many individuals with different words for the same thing, and limited in length, machine-generated metadata can be updated any number of times, generated from the perspective of any user, constrained to a standardized set of terms that can be evolved over time, and be any length required. Machine-learning generated metadata offers benefits but also additional needs in terms of version control, process transparency, human-computer interaction, and IT requirements. As a successful example, well discuss how a dataset of abstracts and associated human-tagged keywords from a standardized list of several thousand keywords were used to create a machine-learning model that predicted keyword metadata for open-source code projects on code.nasa.gov. Well also discuss a less successful example from data.nasa.gov to show how data archive architecture and characteristics of initial metadata can be strong controls on how easy it is to leverage programmatic methods to reuse metadata to create additional metadata

    Evolutionary Convergence to Ideal Free Dispersal Strategies and Coexistence

    Get PDF
    We study a two species competition model in which the species have the same population dynamics but different dispersal strategies and show how these dispersal strategies evolve. We introduce a general dispersal strategy which can result in the ideal free distributions of both competing species at equilibrium and generalize the result of Averill et al. (2011). We further investigate the convergent stability of this ideal free dispersal strategy by varying random dispersal rates, advection rates, or both of these two parameters simultaneously. For monotone resource functions, our analysis reveals that among two similar dispersal strategies, selection generally prefers the strategy which is closer to the ideal free dispersal strategy. For nonmonotone resource functions, our findings suggest that there may exist some dispersal strategies which are not ideal free, but could be locally evolutionarily stable and/or convergent stable, and allow for the coexistence of more than one species
    • …
    corecore