@inproceedings{BurgerSarkarKirschetal., author = {Burger, David and Sarkar, Amitrajit and Kirsch, Konstantin and D{\"u}nnweber, Jan}, title = {Combining Fill-Level Sensing with Route Optimization for a More Efficient Waste Collection}, series = {ECDG 2018 - European Conference on Digital Government, 2018, Santiago De Compostela, Spain}, booktitle = {ECDG 2018 - European Conference on Digital Government, 2018, Santiago De Compostela, Spain}, editor = {Bouzas Lorenzo, Ram{\´o}n}, isbn = {9781912764037}, pages = {24 -- 31}, abstract = {We tackle the problem that collecting all the waste of modern cities within the scheduled time spans becomes increasingly challenging, while the waste collection team is not supplemented accordingly in many places, e.g. by more staff or vehicles. Separating waste has become natural for urban populations, as recycling is ecologically necessary. However, the separation also leads to a continuously increasing number of containers which are logistically unmanageable without computer-aided collection scheduling. Regensburg recently introduced a new program for the collection of biological waste, which extends the private collection of such waste by a few hundred public biological waste containers. Computer support was pretty basic so far, i.e. the collection times were recorded and the routes were sporadically rescheduled manually in an Excel sheet. We show that much shorter waste collection routes can be found automatically using a dynamic version of the classic Ant Colony Optimization (ACO) algorithm for shortening the collection routes. Moreover, we sketch an loT (lnternet-of-Things) approach to "lntelligent Waste Containers" which we equip with ultrasonic sensors monitoring the fill levels, which allows us to skip poorly used containers during the collection and reposition them on demand. By means of a computer simulation with online visualization, we illustrate that our optimized and dynamically adapted collection routes lead to significant time savings. Indeed, more than twice the number of currently used containers can be collected within the same time. We also report about the first experiments that we conducted with real sensors. The presented work is the result of a cooperation between four contributing parties: 1) Technical University of Regensburg (OTH); 2) Ara Institute of Canterbury; 3) Regensburg's Governmental Department of Waste Management; and 4) an industry partner (kpit.com). We compare the outcome of our project with related work and we sketch some future perspectives and ideas for transforming Regensburg into an even more automatized, environmentally friendly "smart city".}, language = {en} } @inproceedings{DuennweberSarkarPuthiyadathetal., author = {D{\"u}nnweber, Jan and Sarkar, Amitrajit and Puthiyadath, Vimal Kumar and Barde, Omkar}, title = {A Tale of Four Cities - Improving Bus and Waste Collection Schedules in Practical Smart City Applications}, series = {Computer Information Systems and Industrial Management}, booktitle = {Computer Information Systems and Industrial Management}, editor = {Saeed, Khalid and Dvorsk{\´y}, Jiř{\´i}}, publisher = {Springer}, address = {Cham}, isbn = {978-3-030-84340-3}, doi = {10.1007/978-3-030-84340-3_30}, pages = {369 -- 380}, abstract = {Computer-based Improvements of waste collection and public transport procedures are often a part of smart city initiatives. When we envision an ideal bus network, it will primarily connect the most crowded bus stops. Similarly, an ideal waste collection vehicle will arrive at every container exactly at the time when it is fully loaded. Beyond doubt, this will reduce traffic and support environmentally friendly intentions like waste separation, as it will make more containers manageable. A difficulty of putting that vision into practice is that vehicles cannot always be where they are needed. Knowing the best time for arriving at a position is not insufficient for finding the optimal route. Therefore, we compare four different approaches to optimized routing: Regensburg, Christchurch, Malaysia, and Bangalore. Our analysis shows that the best schedules result from adapting field-tested routes frequently based on sensor measurements and route optimizing computations.}, language = {en} } @inproceedings{StadlerSarkarDuennweber, author = {Stadler, Timo and Sarkar, Amitrajit and D{\"u}nnweber, Jan}, title = {Bus Demand Forecasting for Rural Areas Using XGBoost and Random Forest Algorithm}, series = {CISIM2021: 20th International Conference on Computer Information Systems and Industrial Management Applications, September 24-26 2021, Ełk, Poland}, booktitle = {CISIM2021: 20th International Conference on Computer Information Systems and Industrial Management Applications, September 24-26 2021, Ełk, Poland}, editor = {Saeed, Khalid and Dvorsk{\´y}, Jiř{\´i}}, publisher = {Springer}, address = {Cham}, isbn = {978-3-030-84340-3}, doi = {10.1007/978-3-030-84340-3_36}, pages = {442 -- 453}, abstract = {In recent years, mobility solutions have experienced a significant upswing. Consequently, it has increased the importance of forecasting the number of passengers and determining the associated demand for vehicles. We analyze all bus routes in a rural area in contrast to other work that predicts just a single bus route. Some differences in bus routes in rural areas compared to cities are highlighted and substantiated by a case study data using Roding, a town in the rural district of Cham in northern Bavaria, as an example. Data collected and we selected a random forest model that lets us determine the passenger demand, bus line effectiveness, or general user behavior. The prediction accuracy of the selected model is currently 87\%. The collected data helps to build new mobility-as-a-service solutions, such as on-call buses or dynamic route optimizations, as we show with our simulation.}, subject = {{\"O}ffentlicher Personennahverkehr}, language = {en} } @inproceedings{DuennweberLorenzBraeuetal., author = {D{\"u}nnweber, Jan and Lorenz, Marcel and Br{\"a}u, Fabian and Saito, Hiroshi and Melzer, Matthias}, title = {Driving out the Bears from the Suburbs by Means of Location Theory and Intelligent Agents}, series = {Proceedings of the ACM 12th International Conference on Animal-Computer Interaction, ACI 2025: The International Conference on Animal-Computer Interaction ; Indiana USA ; 01-04.12.2025}, booktitle = {Proceedings of the ACM 12th International Conference on Animal-Computer Interaction, ACI 2025: The International Conference on Animal-Computer Interaction ; Indiana USA ; 01-04.12.2025}, publisher = {ACM}, address = {New York, NY, USA}, isbn = {9798400721236}, doi = {10.1145/3768539.3768546}, pages = {9}, abstract = {Due to the recent surge in bear attacks, affected municipalities have taken various measures to drive out the intruders. Political considerations include, in many places, the expansion of shooting permits. More and more regional governmental authorities invest in technologies for efficient bear hunting, such as IP cameras and computer vision. From an ecological perspective, such procedures, which are all solely aimed at decreasing the bear population, are questionable, since ecosystems can benefit from a peaceful coexistence of bears with humans: Bears remove animal carcasses and thus return vital nutrients to the soil and prevent the spread of diseases. Moreover, the bears keep the deer population in check, which is advantageous for the forest vegetation. Conflicts start, once the bears intrude populated areas, which are often rural villages and suburbs with a low population density. Naturally, bears do not see humans as prey and respect their size. When the animal attacks, this happens rather for territorial or protective reasons, e. g., after an unexpected encounter with humans unsettled it. In this work, we analyze means to eradicate the danger: We dynamically apply Weiszfeld's algorithm for finding the shifting geometric median between time-windowed black bear sightings and use the results for implementing an early warning system. In addition, we weigh the spotted locations and predict the expected migration behavior between bear habitats using a simulation with intelligent agents. As a case study, we apply our software to data from Romania and Fukushima and identify the positions where bear repelling facilities should be placed most effectively.}, language = {en} } @inproceedings{HoffmannDietrichMelzeretal., author = {Hoffmann, Tim and Dietrich, Florian and Melzer, Matthias and D{\"u}nnweber, Jan}, title = {A Code Generation Framework for Indoor Robot Applications Based on Building Information Modeling (BIM)}, series = {Automation, Robotics \& Communications for Industry 4.0/5.0: Proceedings of the 6th Winter IFSA Conference on Automation, Robotics \& Communications for Industry 4.0/5.0/6.0 (ARCI' 2026) 25-27 February 2026 Salzburg, Austria}, booktitle = {Automation, Robotics \& Communications for Industry 4.0/5.0: Proceedings of the 6th Winter IFSA Conference on Automation, Robotics \& Communications for Industry 4.0/5.0/6.0 (ARCI' 2026) 25-27 February 2026 Salzburg, Austria}, editor = {Yurish, Sergey Y.}, publisher = {IFSA}, isbn = {978-84-09-82030-6}, pages = {40 -- 44}, abstract = {We present BIM2Robot, a framework connecting the digital planning world (Building Information Modeling) with real-world robotics. The aim of the tools we developed is to convert building data from IFC building plans (Industry Foundation Classes) such that autonomous robots can use them for navigation and task planning. Conventional robotics systems rely on hard-coded maps or proprietary data. In the BIM2Robot framework, we generate a robot-compatible building model automatically from existing BIM data. This model describes rooms, walls, doors, and connections allowing robots to understand their environment, move around in it, and carry out useful missions. Besides the data transformation tools, our software framework comprises a graphical user interface which allows for interactive planning, path visualization and remote process control. The generated building model can be used directly by ROS-compliant robots or in robot simulation environments, forming a basis for navigation, perception, and interaction. The manual post-processing of the generated robot motion plans is supported at GUI- and also at code-level.}, language = {en} } @article{WeigertGalkaDuennweberetal., author = {Weigert, Alexander and Galka, Stefan and D{\"u}nnweber, Jan and Meißner, Sebastian and Riege, Jacob and B{\"o}ck, Hendrik and Wagner, Martin}, title = {Simulationsframework mit Anordnungsalgorithmus von Petri-Netzen}, series = {Zeitschrift f{\"u}r wirtschaftlichen Fabrikbetrieb}, volume = {121}, journal = {Zeitschrift f{\"u}r wirtschaftlichen Fabrikbetrieb}, number = {3}, publisher = {DeGruyter}, doi = {10.1515/zwf-2026-1035}, pages = {125 -- 130}, abstract = {Die serienm{\"a}ßige Produktion von Elektrolysezellen befindet sich im Anfangsstadium, sodass belastbare Erfahrungen f{\"u}r standardisierte Produktionssysteme fehlen. Die Planung ist daher durch hohe Unsicherheit gepr{\"a}gt. Unterschiedliche Gestaltungsm{\"o}glichkeiten der Produktionssysteme m{\"u}ssen fr{\"u}hzeitig bewertet und ihre Leistungsf{\"a}higkeit mit dynamischen Methoden, wie der Simulation, abgesichert werden. Anhand eines von den Autoren entwickelten Simulationsframeworks mit automatisierter Modellgenerierung auf Basis der Petri-Netz-Logik zeigt dieser Beitrag die M{\"o}glichkeit der Simulation von Produktionssystemen in der Planung. Ein besonderes Leistungsmerkmal des Frameworks ist, dass zun{\"a}chst un{\"u}bersichtlich generierte Modelle mit einem Graphenalgorithmus so angeordnet werden, dass ihre Funktionsweise aus der Darstellung nachvollziehbar wird.}, language = {de} }