检索结果-内蒙古大学图书馆

Electric Vehicle Routing Problem with Capacitated Charging Stations and Dynamic Electricity Prices

学校读者我要写书评

暂无评论

IEEE Internet of Things Journal 2025年

作者： He, Zhiye Tian, Yuning Miao, Haoyu Yao, Canqi Yang, Zaiyue Shenzhen Key Laboratory of Control Theory and Intelligent Systems Guangdong Provincial Key Laboratory of Fully Actuated System Control Theory and Technology Guangdong Provincial Key Laboratory of Human-Augmentation and Rehabilitation Robotics in Universities School of System Design and Intelligent Manufacturing Shenzhen518055 China The Hong Kong Polytechnic University Department of Logistics and Maritime Studies Hong Kong Hong Kong

With rapid electrification of transportation systems in recent years, the electric vehicle routing problem (EVRP) has received increasing attention. In order to serve a set of valuable transportation tasks using a fleet of electric vehicles, EVRP intends to jointly determine their routes and the charging schedules, with the aim of optimizing service reward and charging cost under state of charge (SOC) constraints of battery. EVRP is a difficult nonlinear integer program, and due to its intrinsic NP-hardness early EVRP studies often oversimplify the charging process and assume unlimited capacity of charging stations and constant electricity price. The contribution of this paper lies in twofold. First, to better characterize the practical charging process, this paper introduces a new graph model that can take the charging station capacity and dynamic electricity price into full consideration. Second, we design a series of transformation techniques, including reformulation SOC dynamics, Lagrangian relaxation, exact linear programming relaxation, etc, which eventually convert the original EVRP into an approximate linear program. Extensive simulations across 14 instances demonstrate that, the proposed approach is capable of solving large-scale instances over 500 nodes, and is 100 times faster than traditional analytic methods while achieving very close optimality. While comparing with the popular heuristic method ALNS (Adaptive Large Neighborhood Search), our method is several times faster and obtains much better optimality. © 2014 IEEE.

关键词： Charging stations

SLAM-Based Joint Calibration of Differential RSS Sensor Array and Source Localization 49

学校读者我要写书评

暂无评论

SLAM-Based Joint Calibration of Differential RSS Sensor Arra...

49th Annual Conference of the IEEE Industrial Electronics Society, IECON 2023

作者： Fu, Linya Qiao, Xu Huang, Shoudong Mao, Guoqiang Lin, Zhiyun Li, Youfu Kong, He Robotics Institute Uni. of Technology Sydney Sydney Australia Xidian University State Key Laboratory of Integrated Services Networks China City University of Hong Kong Department of Mechanical Engineering China Southern Uni. of Sci. and Tech. Shenzhen Key Laboratory of Control Theory and Intelligent Systems Shenzhen China Southern Uni. of Sci. and Tech. Guangdong Prov. Key Laboratory of Human-Augmentation and Rehabilitation Robotics in Universities Shenzhen China

ISBN: (纸本)9798350331820

Sensor arrays generating differential received signal strength (DRSS) measurements have found many applications in robotics. However, accurate calibration of these sensor arrays remains a challenge. Most existing methods are impractical in that they assume to know signal source positions or certain parameters (i.e., path loss exponent), and try to estimate the others. In this paper, we adopt graph simultaneous localization and mapping (SLAM) as a general framework for jointly estimating the source positions and parameters of the DRSS sensor array. Our contributions are twofold. On the one hand, by using a Fisher information matrix approach, we conduct a systematic observability analysis of the corresponding SLAM setup for the calibration problem. On the other hand, we propose an effective procedure to select the initial value which is fed to Levenberg-Marquardt iterations for further improving optimization accuracy and convergence. Extensive simulation and hardware experiments show that the proposed method renders high-quality calibration results. All the codes and data are publicly available at https://***/SUSTech2022/DRSS-sensor-array-calibration. © 2023 IEEE.

关键词： Calibration

SLAM-based Joint Calibration of Multiple Asynchronous Microphone Arrays and Sound Source Localization

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Wang, Jiang He, Yuanzheng Su, Daobilige Itoyama, Katsutoshi Nakadai, Kazuhiro Wu, Junfeng Huang, Shoudong Li, Youfu Kong, He The Shenzhen Key Laboratory of Control Theory and Intelligent Systems Southern University of Science and Technology No. 1088 Xueyuan Avenue Shenzhen China The College of Engineering China Agricultural University Beijing China The Department of Systems and Control Engineering Tokyo Institute of Technology Tokyo Japan The School of Data Science The Chinese University of Hong Kong Shenzhen China The Robotics Institute University of Technology Sydney Sydney Australia The Department of Mechanical Engineering City University of Hong Kong Hong Kong

Robot audition systems with multiple microphone arrays have many applications in practice. However, accurate calibration of multiple microphone arrays remains challenging because there are many unknown parameters to be identified, including the relative transforms (i.e., orientation, translation) and asynchronous factors (i.e., initial time offset and sampling clock difference) between microphone arrays. To tackle these challenges, in this paper, we adopt batch simultaneous localization and mapping (SLAM) for joint calibration of multiple asynchronous microphone arrays and sound source localization. Using the Fisher information matrix (FIM) approach, we first conduct the observability analysis (i.e., parameter identifiability) of the above-mentioned calibration problem and establish necessary/sufficient conditions under which the FIM and the Jacobian matrix have full column rank, which implies the identifiability of the unknown parameters. We also discover several scenarios where the unknown parameters are not uniquely identifiable. Subsequently, we propose an effective framework to initialize the unknown parameters, which is used as the initial guess in batch SLAM for multiple microphone arrays calibration, aiming to further enhance optimization accuracy and convergence. Extensive numerical simulations and real experiments have been conducted to verify the performance of the proposed method. The experiment results show that the proposed pipeline achieves higher accuracy with fast convergence in comparison to methods that use the noise-corrupted ground truth of the unknown parameters as the initial guess in the optimization and other existing frameworks. © 2024, CC BY.

关键词： Mapping

Knowledge-aware Graph Transformer for Pedestrian Trajectory Prediction

学校读者我要写书评

暂无评论

Knowledge-aware Graph Transformer for Pedestrian Trajectory ...

International Conference on Intelligent Transportation

作者： Yu Liu Yuexin Zhang Kunming Li Yongliang Qiao Stewart Worrall You-Fu Li He Kong Shenzhen Key Laboratory of Control Theory and Intelligent Systems Southern University of Science and Technology (SUSTech) Shenzhen China Department of Mechanical Engineering City University of Hong Kong Hong Kong SAR China School of Automation Guangdong Polytechnic Normal University Guangzhou China Australian Centre for Field Robotics The University of Sydney NSW Australia Australian Institute for Machine Learning The University of Adelaide SA Australia Department of Mechanical Engineering City University of Hong Kong Hong Kong SAR China Shenzhen Key Laboratory of Control Theory and Intelligent Systems SUSTech Shenzhen China Guangdong Provincial Key Laboratory of Human-Augmentation Rehabilitation Robotics in Universities SUSTech Shenzhen China

Predicting pedestrian motion trajectories is crucial for path planning and motion control of autonomous vehicles. Accurately forecasting crowd trajectories is challenging due to the uncertain nature of human motions in different environments. For training, recent deep learning-based prediction approaches mainly utilize information like trajectory history and interactions between pedestrians, among others. This can limit the prediction performance across various scenarios since the discrepancies between training datasets have not been properly incorporated. To overcome this limitation, this paper proposes a graph transformer structure to improve prediction performance, capturing the differences between the various sites and scenarios contained in the datasets. In particular, a self-attention mechanism and a domain adaption module have been designed to improve the generalization ability of the model. Moreover, an additional metric considering cross-dataset sequences is introduced for training and performance evaluation purposes. The proposed framework is validated and compared against existing methods using popular public datasets, i.e., ETH and UCY. Experimental results demonstrate the improved performance of our proposed scheme.

关键词：

Knowledge-aware Graph Transformer for Pedestrian Trajectory Prediction

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Liu, Yu Zhang, Yuexin Li, Kunming Qiao, Yongliang Worrall, Stewart Li, You-Fu Kong, He Shenzhen518055 China Department of Mechanical Engineering City University of Hong Kong Hong Kong School of Automation Guangdong Polytechnic Normal University Guangzhou510665 China Australian Centre for Field Robotics The University of Sydney NSW2006 Australia Australian Institute for Machine Learning The University of Adelaide SA5005 Australia Shenzhen Key Laboratory of Control Theory and Intelligent Systems SUSTech Shenzhen518055 China Guangdong Provincial Key Laboratory of Human-Augmentation and Rehabilitation Robotics in Universities SUSTech Shenzhen518055 China

Predicting pedestrian motion trajectories is crucial for path planning and motion control of autonomous vehicles. Accurately forecasting crowd trajectories is challenging due to the uncertain nature of human motions in different environments. For training, recent deep learning-based prediction approaches mainly utilize information like trajectory history and interactions between pedestrians, among others. This can limit the prediction performance across various scenarios since the discrepancies between training datasets have not been properly incorporated. To overcome this limitation, this paper proposes a graph transformer structure to improve prediction performance, capturing the differences between the various sites and scenarios contained in the datasets. In particular, a self-attention mechanism and a domain adaption module have been designed to improve the generalization ability of the model. Moreover, an additional metric considering crossdataset sequences is introduced for training and performance evaluation purposes. The proposed framework is validated and compared against existing methods using popular public datasets, i.e., ETH and UCY. Experimental results demonstrate the improved performance of our proposed scheme. © 2024, CC BY.

关键词： Trajectories

Immersion of General Nonlinear Systems Into State-Affine Ones for the Design of Generalized Parameter Estimation-Based Observers: A Simple Algebraic Procedure

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Ortega, Romeo Bobtsov, Alexey Romero, Jose Guadalupe Fang, Leyan Departamento Académico de Ingeniería Eléctrica y Electrónica ITAM Ciudad de México Mexico Control Systems and Robotics Department ITMO St. Petersburg Russia Center for Control Theory and Guidance Technology Harbin Institute of Technology Harbin China Departamento Académico de Ingeniería Eléctrica y Electrónica ITAM Río Hondo 1 Ciudad de México01080 Mexico

Generalized parameter estimation-based observers have proven very successful to deal with systems described in state-affine form. In this paper, we enlarge the domain of applicability of this method proposing an algebraic procedure to immerse an ndimensional general nonlinear system into and nz-dimensional system in state affine form, with nz > n. First, we recall the necessary and sufficient condition for the solution of the general problem, which requires the solution of a partial differential equation that, moreover, has to satisfy a restrictive injectivity condition. Given the complexity of this task we propose an alternative simple algebraic method to identify the required dynamic extension and coordinate transformation, a procedure that, as shown in the paper, is rather natural for physical systems. We illustrate the method with some academic benchmark examples from observer theory literature—that, in spite of their apparent simplicity, are difficult to solve with the existing methods—as well as several practically relevant physical examples. © 2024, CC BY-SA.

关键词： Algebra

SLAM-Based Joint Calibration of Differential RSS Sensor Array and Source Localization

学校读者我要写书评

暂无评论

SLAM-Based Joint Calibration of Differential RSS Sensor Arra...

Annual Conference of Industrial Electronics Society

作者： Linya Fu Xu Qiao Shoudong Huang Guoqiang Mao Zhiyun Lin Youfu Li He Kong Shenzhen Key Laboratory of Control Theory and Intelligent Systems Southern Uni. of Sci. and Tech. Shenzhen China Robotics Institute Uni. of Technology Sydney Sydney Australia State Key Laboratory of Integrated Services Networks Xidian University China Department of Mechanical Engineering City University of Hong Kong China Guangdong Provincial Key Laboratory of Human-Augmentation and Rehabilitation Robotics in Universities Southern Uni. of Sci. and Tech. Shenzhen China

关键词：

Revisiting "Consensus-based energy-management in smart grid with transmission losses and directed communication"

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zimmermann, Jan Tatarenko, Tatiana Willert, Volker Adamy, Jürgen Control Theory and Robotics Lab Department of Electrical Engineering Technical University of Darmstadt 64283 Germany

We discovered a deficiency in Algorithm 1 and Theorem 3 of [1]. The algorithm called CEMA aims to solve an energy management problem distributively. However, by means of a counter example, we show that Theorem 2 and 3 of [1] contradict each other in the case of a valid scenario, proving that the suggested algorithm does not always find the optimum. Furthermore, we provide theoretic results, showing that Theorem 3 of [1] does not hold generally. At last, we provide a rectification by adjusting the algorithm and the corresponding proof of Theorem 3. Copyright © 2020, The Authors. All rights reserved.

关键词： Energy management

Bandit Learning in Convex Non-Strictly Monotone Games

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Tatarenko, Tatiana Kamgarpour, Maryam The Department of Control Theory and Robotics TU Darmstadt Germany The EPFL School of Engineering Sycamore Lab Switzerland

We address learning Nash equilibria in convex games under the payoff information setting. We consider the case in which the game pseudo-gradient is monotone but not necessarily strictly monotone. This relaxation of strict monotonicity enables application of learning algorithms to a larger class of games, such as, for example, a zero-sum game with a merely convex-concave cost function. We derive an algorithm whose iterates provably converge to the least-norm Nash equilibrium in this setting. From the perspective of a single player using the proposed algorithm, we view the game as an instance of online optimization. Through this lens, we quantify the regret rate of the algorithm and provide an approach to choose the algorithm's parameters to minimize the regret rate. © 2020, CC BY.

关键词： Learning algorithms