Literature Database Entry

stratmann2024coordinated

Lukas Stratmann, Julian Heinovski and Falko Dressler, "Coordinated Group Cycling for Commuting," Proceedings of 30th ACM International Conference on Mobile Computing and Networking (MobiCom 2024), Poster Session, Washington, D.C., November 2024. (to appear)

Abstract

A crucial step for reducing emissions in the transport sector is the shift towards public transportation and bicycling. However, due to the lack of perceived safety, people are reluctant to commute by bicycle. A potential solution to this problem could be group cy- cling, allowing cyclists to form a group with others in order to ride together. Depending on local traffic laws, such groups allow for cycling next to each other and for special rights for intersection cross- ing. In this paper, we outline how group cycling commutes may be coordinated using communication capabilities of contemporary smartphones. We showcase how group cycling can reduce waiting times and, thus, improve ride comfort and safety in a simulation- based case study.

Quick access

BibTeX BibTeX

Contact

Lukas Stratmann
Julian Heinovski
Falko Dressler

BibTeX reference

@inproceedings{stratmann2024coordinated,
    author = {Stratmann, Lukas and Heinovski, Julian and Dressler, Falko},
    note = {to appear},
    title = {{Coordinated Group Cycling for Commuting}},
    publisher = {ACM},
    address = {Washington, D.C.},
    booktitle = {30th ACM International Conference on Mobile Computing and Networking (MobiCom 2024), Poster Session},
    month = {11},
    year = {2024},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.