Arrow Research search

Author name cluster

Henning Mortveit

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

10 papers
1 author row

Possible papers

10

AAAI Conference 2026 Conference Paper

Towards High Resolution Probabilistic Coastal Inundation Forecasting from Sparse Observations

  • Kazi Ashik Islam
  • Zakaria Mehrab
  • Mahantesh M Halappanavar
  • Henning Mortveit
  • Katragadda Sridhar
  • Jon Derek Loftis
  • Stefan Hoops
  • Madhav Marathe

Coastal flooding poses increasing threats to communities worldwide, necessitating accurate and hyper-local inundation forecasting for effective emergency response. However, real-world deployment of forecasting systems is often constrained by sparse sensor networks, where only a limited subset of locations may have sensors due to budget constraints. To approach this challenge, we present Diff-Sparse, a masked conditional diffusion model designed for probabilistic coastal inundation forecasting from sparse sensor observations. Diff-Sparse primarily utilizes the inundation history of a location and its neighboring locations from a context time window as spatiotemporal context. The fundamental challenge of spatiotemporal prediction based on sparse observations in the context window is addressed by introducing a novel masking strategy during training. Digital elevation data and temporal co-variates are utilized as additional spatial and temporal contexts, respectively. A convolutional neural network and a conditional UNet architecture with cross-attention mechanism are employed to capture the spatiotemporal dynamics in the data. We trained and tested Diff-Sparse on coastal inundation data from the Eastern Shore of Virginia and systematically assessed the performance of Diff-Sparse across different sparsity levels (0%, 50%, 95% missing observations). Our experiment results show that Diff-Sparse achieves upto 62% improvement in terms of two forecasting performance metrics compared to existing methods, at 95% sparsity level. Moreover, our ablation studies reveal that digital elevation data becomes more useful at high sparsity levels compared to temporal co-variates.

IJCAI Conference 2025 Conference Paper

Hazard Function Guided Agent-Based Models: A Case Study of Return Migration from Poland to Ukraine

  • Zakaria Mehrab
  • S. S. Ravi
  • Logan Stundal
  • Samarth Swarup
  • Srini Venkatramanan
  • Bryan Lewis
  • Henning Mortveit
  • David Leblang

The Russian invasion of Ukraine in February 2022 has led to the largest forced migration crisis in Europe since World War II, with millions displaced both internally and internationally. Among the displaced, approximately 4. 2 million individuals have returned, highlighting the significance of return migration as a critical phase in the migration continuum. Existing studies on return migration are limited in scope, relying on survey-based approaches that suffer from demographic bias, lack of validation against ground truth, and inability to account for uncertainty. We propose a novel computational framework for modeling the return of conflict-induced migrants, using agent-based models (ABMs) and their surrogates. These models are grounded in hazard functions and account for sociopolitical contexts. Our proposed ABMs outperform baseline methods in estimating return migration from Poland to Ukraine by at least 42% and by as much as 57% in terms of normalized root mean squared error (NRMSE). Further, to illustrate the utility of such models for policymakers, we conduct two case studies that estimate the duration of displacement and characterize the demographic breakdown among the returnees.

AAMAS Conference 2024 Conference Paper

Assessing Fairness of Residential Dynamic Pricing for Electricity using Active Learning with Agent-based Simulation

  • Swapna Thorve
  • Henning Mortveit
  • Anil Vullikanti
  • Madhav Marathe
  • Samarth Swarup

Extreme weather events and fast-paced adoption of green energy technologies have led to new challenges in demand-side management, maintaining grid reliability, and fulfilling variable consumer demands One of the effective ways to address these difficulties is by introducing economic incentives – replacing the flat rate tariffs with dynamic tariffs. However, dynamic pricing schemes need to be designed carefully to consider fairness and benefits for consumers as well as power companies. This paper describes an ML-based simulation framework for exploring two fairness constructs of dynamic pricing for residential electricity with behavioral agent-based models based on social theory combined with active learning. As an example, we simulate behavior adaptations in response to changes in electricity prices to study cost savings through monthly bills and peak demand reduction in synthetic household agents in a Time Of Use (TOU) pricing scheme in Virginia, USA. Further, we can show that there exists a region in the parameter space that corresponds to a fair TOU pricing scheme for both entities: all income-stratified communities and power companies.

AAMAS Conference 2024 Conference Paper

Network Agency: An Agent-based Model of Forced Migration from Ukraine

  • Zakaria Mehrab
  • Logan Stundal
  • Samarth Swarup
  • Srinivasan Venaktramanan
  • Bryan Lewis
  • Henning Mortveit
  • Christopher Barrett
  • Abhishek Pandey

Individuals in social systems are embedded in collective decisionmaking hierarchies, such as households, neighborhoods, communities, organizations, etc. The locus of agency in such systems is dispersed across the system, and can variously be viewed as individual, distributed, and shared agency. Here we propose a general notion of network agency that subsumes these descriptions and also allows for integrating related notions, such as peer influence. In our view, the social system can be seen as a multi-layer network, where each layer corresponds to different aggregations of the underlying units, representing different kinds of perception and decision-making. We illustrate this general framework with an agent-based model of the ongoing forced migration from Ukraine. In our model, individuals perceive hazards (conflict events), but decisions to migrate are taken at the household level, where peer influence from other households in the neighborhood is also taken into account. We present this model in detail to elucidate our concept of network agency. We also calibrate the model with data on daily refugee flows and show that our model is able to estimate the scale of the daily refugee flow from Ukraine for the first two months with a Root Mean Squared Percentage Error (RMSPE) of 0. 24, outperforming state-of-the-art, which had an RMSPE of 0. 77. Moreover, our model also captures the daily trend of outflow with a Pearson Correlation Coefficient (PCC) of 0. 98. We also perform This work is licensed under a Creative Commons Attribution International 4. 0 License. Proc. of the 23rd International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2024), N. Alechina, V. Dignum, M. Dastani, J. S. Sichman (eds.), May 6 – 10, 2024, Auckland, New Zealand. © 2024 International Foundation for Autonomous Agents and Multiagent Systems (www. ifaamas. org). sensitivity analysis of the model and analyze the significant parameters of the model, which in turn tells us how different agencies are significant in different contexts.

AAMAS Conference 2024 Conference Paper

Strategic Routing and Scheduling for Evacuations

  • Kazi Ashik Islam
  • Da Qi Chen
  • Madhav Marathe
  • Henning Mortveit
  • Samarth Swarup
  • Anil Vullikanti

Evacuation planning is an essential part of disaster management where the goal is to relocate people under imminent danger to safety. Although government authorities often prescribe routes and schedule, evacuees generally behave as self-interested agents and may choose their actions in a selfish manner. It is crucial to understand the degree of inefficiency this can cause to the evacuation process. In this paper, we present a strategic routing and scheduling game (Evacuation Planning Game, epg), where evacuees choose their route and time of departure. We prove that every instance of epg has at least one pure strategy Nash equilibrium. We then present a polynomial time algorithm (Sequential Action Algorithm, saa), for finding equilibria in a given instance. We also provide bounds on how bad an equilibrium state can be compared to a socially optimal state. Finally, we use Harris County of Houston, Texas as our study area and construct a game instance for it. Our results show that, saa can efficiently find equilibria in this instance that have social objective close to the optimal value.

IJCAI Conference 2023 Conference Paper

Simulation-Assisted Optimization for Large-Scale Evacuation Planning with Congestion-Dependent Delays

  • Kazi Ashik Islam
  • Da Qi Chen
  • Madhav Marathe
  • Henning Mortveit
  • Samarth Swarup
  • Anil Vullikanti

Evacuation planning is a crucial part of disaster management. However, joint optimization of its two essential components, routing and scheduling, with objectives such as minimizing average evacuation time or evacuation completion time, is a computationally hard problem. To approach it, we present MIP-LNS, a scalable optimization method that utilizes heuristic search with mathematical optimization and can optimize a variety of objective functions. We also present the method MIP-LNS-SIM, where we combine agent-based simulation with MIP-LNS to estimate delays due to congestion, as well as, find optimized plans considering such delays. We use Harris County in Houston, Texas, as our study area. We show that, within a given time limit, MIP-LNS finds better solutions than existing methods in terms of three different metrics. However, when congestion dependent delay is considered, MIP-LNS-SIM outperforms MIP-LNS in multiple performance metrics. In addition, MIP-LNS-SIM has a significantly lower percent error in estimated evacuation completion time compared to MIP-LNS.

AAMAS Conference 2023 Conference Paper

Towards Optimal and Scalable Evacuation Planning Using Data-driven Agent Based Models

  • Kazi Ashik Islam
  • Da Qi Chen
  • Madhav Marathe
  • Henning Mortveit
  • Samarth Swarup
  • Anil Vullikanti

Evacuation planning is a crucial part of disaster management where the goal is to relocate people to safety and minimize casualties. Every evacuation plan has two essential components: routing and scheduling. However, joint optimization of these two components with objectives such as minimizing average evacuation time is a computationally hard problem. To approach it, we present MIP- LNS, a scalable optimization method that can optimize a variety of objective functions. We also present the method MIP-LNS-SIM, where we combine agent-based simulation with MIP-LNS to more accurately estimate delays on roads due to congestion. We use Harris County in Houston, Texas as our study area. We show that, within a given time limit, MIP-LNS finds better solutions than existing methods in terms of three different metrics. We also perform experiments with MIP-LNS-SIM to show its efficacy in estimating delays due to congestion. Our results show that, when such delays are considered, MIP-LNS-SIM can find better evacuation plans than MIP-LNS. Furthermore, MIP-LNS-SIM provides an estimate of the evacuation completion time for its plan with a small percent error.

IJCAI Conference 2022 Conference Paper

A Reliability-aware Distributed Framework to Schedule Residential Charging of Electric Vehicles

  • Rounak Meyur
  • Swapna Thorve
  • Madhav Marathe
  • Anil Vullikanti
  • Samarth Swarup
  • Henning Mortveit

Residential consumers have become active participants in the power distribution network after being equipped with residential EV charging provisions. This creates a challenge for the network operator tasked with dispatching electric power to the residential consumers through the existing distribution network infrastructure in a reliable manner. In this paper, we address the problem of scheduling residential EV charging for multiple consumers while maintaining network reliability. An additional challenge is the restricted exchange of information: where the consumers do not have access to network information and the network operator does not have access to consumer load parameters. We propose a distributed framework which generates an optimal EV charging schedule for individual residential consumers based on their preferences and iteratively updates it until the network reliability constraints set by the operator are satisfied. We validate the proposed approach for different EV adoption levels in a synthetically created digital twin of an actual power distribution network. The results demonstrate that the new approach can achieve a higher level of network reliability compared to the case where residential consumers charge EVs based solely on their individual preferences, thus providing a solution for the existing grid to keep up with increased adoption rates without significant investments in increasing grid capacity.

AAMAS Conference 2022 Conference Paper

Data-driven Agent-based Models for Optimal Evacuation of Large Metropolitan Areas for Improved Disaster Planning

  • Kazi Ashik Islam
  • Madhav Marathe
  • Henning Mortveit
  • Samarth Swarup
  • Anil Vullikanti

Evacuation plans are designed to move people to safety in case of a disaster. It mainly consists of two components: routing and scheduling. Joint optimization of these two components with the goal of minimizing total evacuation time is a computationally hard problem, specifically when the problem instance is large. Moreover, often in disaster situations, there is uncertainty regarding the passability of roads throughout the evacuation time period. In this paper, we present a way to model the time-varying risk associated with roads in disaster situations. We also design a heuristic method based on the well known Large Neighborhood Search framework to perform the joint optimization task. We use real-world road network and population data from Harris County in Houston, Texas and apply our heuristic to find evacuation routes and schedules for the area. We show that the proposed method is able to find good solutions within a reasonable amount of time. We also perform agent-based simulations of the evacuation using these solutions to evaluate their quality and efficacy.

AAAI Conference 2013 Conference Paper

Sensitivity of Diffusion Dynamics to Network Uncertainty

  • Abhijin Adiga
  • Chris Kuhlman
  • Henning Mortveit
  • Anil Kumar Vullikanti

Simple diffusion processes on networks have been used to model, analyze and predict diverse phenomena such as spread of diseases, information and memes. More often than not, the underlying network data is noisy and sampled. This prompts the following natural question: how sensitive are the diffusion dynamics and subsequent conclusions to uncertainty in the network structure? In this paper, we consider two popular diffusion models: Independent cascades (IC) model and Linear threshold (LT) model. We study how the expected number of vertices that are influenced/infected, given some initial conditions, are affected by network perturbation. By rigorous analysis under the assumption of a reasonable perturbation model we establish the following main results. (1) For the IC model, we characterize the susceptibility to network perturbation in terms of the critical probability for phase transition of the network. We find the expected number of infections is quite stable, unless the the transmission probability is close to the critical probability. (2) We show that the standard LT model with uniform edge weights is relatively stable under network perturbations. (3) Empirically, the transient behavior, i. e. , the time series of the number of infections, in both models appears to be more sensitive to network perturbations. We also study these questions using extensive simulations on diverse real world networks, and find that our theoretical predictions for both models match the empirical observations quite closely.

v2026.09.13