Agents
Elastic buildings: Calibrated district-scale simulation of occupant-flexible campus operation for hybrid work optimization
Mosteiro-Romero, Martín, Miller, Clayton, Chong, Adrian, Stouffs, Rudi
Before 2020, the way occupants utilized the built environment had been changing slowly towards scenarios in which occupants have more choice and flexibility in where and how they work. The global COVID-19 pandemic accelerated this phenomenon rapidly through lockdowns and hybrid work arrangements. Many occupants and employers are considering keeping some of these flexibility-based strategies due to their benefits and cost impacts. This paper simulates various scenarios related to the operational technologies and policies of a real-world campus using a district-scale City Energy Analyst (CEA) model that is calibrated with measured energy and occupancy profiles extracted from WiFi data. These scenarios demonstrate the energy impact of ramping building operations up and down more rapidly and effectively to the flex-based work strategies that may solidify. The scenarios show a 4-12% decrease in space cooling demand due to occupant absenteeism if centralized building system operation is in place, but as high as 21-68% if occupancy-driven building controls are implemented. The paper discusses technologies and strategies that are important in this paradigm shift of operations.
SEA: A Spatially Explicit Architecture for Multi-Agent Reinforcement Learning
Li, Dapeng, Xu, Zhiwei, Zhang, Bin, Fan, Guoliang
Spatial information is essential in various fields. How to explicitly model according to the spatial location of agents is also very important for the multi-agent problem, especially when the number of agents is changing and the scale is enormous. Inspired by the point cloud task in computer vision, we propose a spatial information extraction structure for multi-agent reinforcement learning in this paper. Agents can effectively share the neighborhood and global information through a spatially encoder-decoder structure. Our method follows the centralized training with decentralized execution (CTDE) paradigm. In addition, our structure can be applied to various existing mainstream reinforcement learning algorithms with minor modifications and can deal with the problem with a variable number of agents. The experiments in several multi-agent scenarios show that the existing methods can get convincing results by adding our spatially explicit architecture.
Generalizing Liquid Democracy to multi-agent delegation: A Voting Power Measure and Equilibrium Analysis
Liquid democracy has gained popularity in recent years due to its ability to balance representation and delegation of power. In this work, we propose a generalization of the classic model that allows for fractional delegation of voting weight. Our approach enables agents to divide and delegate their votes to multiple agents, while retaining a portion of the voting power for themselves. We discuss the desirable properties of a reasonable generalization of the classic model and introduce a set of simpler voting measures that include a penalty factor on the length of delegation chains. We demonstrate that the proposed voting measure is a well-defined limit of these simpler measures when the penalty approaches zero, and inherits key features of the classic model. In the second part of the article, we investigate the existence of equilibrium states in a delegation game that employs the suggested measures. We show that this game has pure strategy Nash equilibria as long as a penalty on the length of delegation chains is enforced.
Intention Aware Robot Crowd Navigation with Attention-Based Interaction Graph
Liu, Shuijing, Chang, Peixin, Huang, Zhe, Chakraborty, Neeloy, Hong, Kaiwen, Liang, Weihang, McPherson, D. Livingston, Geng, Junyi, Driggs-Campbell, Katherine
We study the problem of safe and intention-aware robot navigation in dense and interactive crowds. Most previous reinforcement learning (RL) based methods fail to consider different types of interactions among all agents or ignore the intentions of people, which results in performance degradation. To learn a safe and efficient robot policy, we propose a novel recurrent graph neural network with attention mechanisms to capture heterogeneous interactions among agents through space and time. To encourage longsighted robot behaviors, we infer the intentions of dynamic agents by predicting their future trajectories for several timesteps. The predictions are incorporated into a model-free RL framework to prevent the robot from intruding into the intended paths of other agents. We demonstrate that our method enables the robot to achieve good navigation performance and non-invasiveness in challenging crowd navigation scenarios. We successfully transfer the policy learned in simulation to a real-world TurtleBot 2i. Our code and videos are available at https://sites.google.com/view/intention-aware-crowdnav/home.
Active Probing and Influencing Human Behaviors Via Autonomous Agents
Wang, Shuangge, Lyu, Yiwei, Dolan, John M.
Autonomous agents (robots) face tremendous challenges while interacting with heterogeneous human agents in close proximity. One of these challenges is that the autonomous agent does not have an accurate model tailored to the specific human that the autonomous agent is interacting with, which could sometimes result in inefficient human-robot interaction and suboptimal system dynamics. Developing an online method to enable the autonomous agent to learn information about the human model is therefore an ongoing research goal. Existing approaches position the robot as a passive learner in the environment to observe the physical states and the associated human response. This passive design, however, only allows the robot to obtain information that the human chooses to exhibit, which sometimes doesn't capture the human's full intention. In this work, we present an online optimization-based probing procedure for the autonomous agent to clarify its belief about the human model in an active manner. By optimizing an information radius, the autonomous agent chooses the action that most challenges its current conviction. This procedure allows the autonomous agent to actively probe the human agents to reveal information that's previously unavailable to the autonomous agent. With this gathered information, the autonomous agent can interactively influence the human agent for some designated objectives. Our main contributions include a coherent theoretical framework that unifies the probing and influence procedures and two case studies in autonomous driving that show how active probing can help to create better participant experience during influence, like higher efficiency or less perturbations.
Guarded Policy Optimization with Imperfect Online Demonstrations
Xue, Zhenghai, Peng, Zhenghao, Li, Quanyi, Liu, Zhihan, Zhou, Bolei
The Teacher-Student Framework (TSF) is a reinforcement learning setting where a teacher agent guards the training of a student agent by intervening and providing online demonstrations. Assuming optimal, the teacher policy has the perfect timing and capability to intervene in the learning process of the student agent, providing safety guarantee and exploration guidance. Nevertheless, in many real-world settings it is expensive or even impossible to obtain a well-performing teacher policy. In this work, we relax the assumption of a well-performing teacher and develop a new method that can incorporate arbitrary teacher policies with modest or inferior performance. We instantiate an Off-Policy Reinforcement Learning algorithm, termed Teacher-Student Shared Control (TS2C), which incorporates teacher intervention based on trajectory-based value estimation. Theoretical analysis validates that the proposed TS2C algorithm attains efficient exploration and substantial safety guarantee without being affected by the teacher's own performance. Experiments on various continuous control tasks show that our method can exploit teacher policies at different performance levels while maintaining a low training cost. Moreover, the student policy surpasses the imperfect teacher policy in terms of higher accumulated reward in held-out testing environments. Code is available at https://metadriverse.github.io/TS2C.
A Neuro-Symbolic Approach for Enhanced Human Motion Prediction
Mghames, Sariah, Castri, Luca, Hanheide, Marc, Bellotto, Nicola
Reasoning on the context of human beings is crucial for many real-world applications especially for those deploying autonomous systems (e.g. robots). In this paper, we present a new approach for context reasoning to further advance the field of human motion prediction. We therefore propose a neuro-symbolic approach for human motion prediction (NeuroSyM), which weights differently the interactions in the neighbourhood by leveraging an intuitive technique for spatial representation called Qualitative Trajectory Calculus (QTC). The proposed approach is experimentally tested on medium and long term time horizons using two architectures from the state of art, one of which is a baseline for human motion prediction and the other is a baseline for generic multivariate time-series prediction. Six datasets of challenging crowded scenarios, collected from both fixed and mobile cameras, were used for testing. Experimental results show that the NeuroSyM approach outperforms in most cases the baseline architectures in terms of prediction accuracy.
Probabilistic Planning with Prioritized Preferences over Temporal Logic Objectives
Li, Lening, Rahmani, Hazhar, Fu, Jie
This paper studies temporal planning in probabilistic environments, modeled as labeled Markov decision processes (MDPs), with user preferences over multiple temporal goals. Existing works reflect such preferences as a prioritized list of goals. This paper introduces a new specification language, termed prioritized qualitative choice linear temporal logic on finite traces, which augments linear temporal logic on finite traces with prioritized conjunction and ordered disjunction from prioritized qualitative choice logic. This language allows for succinctly specifying temporal objectives with corresponding preferences accomplishing each temporal task. The finite traces that describe the system's behaviors are ranked based on their dissatisfaction scores with respect to the formula. We propose a systematic translation from the new language to a weighted deterministic finite automaton. Utilizing this computational model, we formulate and solve a problem of computing an optimal policy that minimizes the expected score of dissatisfaction given user preferences. We demonstrate the efficacy and applicability of the logic and the algorithm on several case studies with detailed analyses for each.
Towards Effective and Interpretable Human-Agent Collaboration in MOBA Games: A Communication Perspective
Gao, Yiming, Liu, Feiyu, Wang, Liang, Lian, Zhenjie, Wang, Weixuan, Li, Siqin, Wang, Xianliang, Zeng, Xianhan, Wang, Rundong, Wang, Jiawei, Fu, Qiang, Yang, Wei, Huang, Lanxiao, Liu, Wei
MOBA games, e.g., Dota2 and Honor of Kings, have been actively used as the testbed for the recent AI research on games, and various AI systems have been developed at the human level so far. However, these AI systems mainly focus on how to compete with humans, less on exploring how to collaborate with humans. To this end, this paper makes the first attempt to investigate human-agent collaboration in MOBA games. In this paper, we propose to enable humans and agents to collaborate through explicit communication by designing an efficient and interpretable Meta-Command Communication-based framework, dubbed MCC, for accomplishing effective human-agent collaboration in MOBA games. The MCC framework consists of two pivotal modules: 1) an interpretable communication protocol, i.e., the Meta-Command, to bridge the communication gap between humans and agents; 2) a meta-command value estimator, i.e., the Meta-Command Selector, to select a valuable meta-command for each agent to achieve effective human-agent collaboration. Experimental results in Honor of Kings demonstrate that MCC agents can collaborate reasonably well with human teammates and even generalize to collaborate with different levels and numbers of human teammates. Videos are available at https://sites.google.com/view/mcc-demo.
A Review On Game Theory With Smart Grid Security
Smart grid is the modern two way mechanism combining the power grid, control center, smart metering facility, energy routing and customer demand response services. The system being complicated, security vulnerabilities are paramount for the sound operation and process continuation. Since smart grid connects with the end user to the energy providers, these two parties can interact with each other within the whole energy management work flow. In this regard, game theory provides effective insights in the analysis of security measures for smart grid. The mentioned parties will be the players in the game model to provide a solution for the various threats to the grid aspects. In this work, a brief review has presented with the existing approaches to the threat models for divergent sectors of the smart grid. The solution approaches to these threats are based on the game theoretical approaches that connect the attackers and defenders in the scenarios.