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

IEEE Conference on Decision and Control

作者： Stefan Kojchev Robert Hult Jonas Fredriksson Volvo Autonomous Solutions and the Mechatronics Group Systems and Control Chalmers University of Technology Volvo Autonomous Solutions Göteborg Sweden Mechatronics Group Systems and Control Chalmers University of Technology Göteborg Sweden

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

We investigate the problem of coordinating multiple automated vehicles (AVs) in confined areas. This problem can be formulated as an optimal control problem (OCP) where the motion of the AVs is optimized such that collisions are avoided in cross-intersections, merge crossings, and narrow roads. The problem is combinatorial and solving it to optimality is prohibitively difficult for all but trivial instances. For this reason, we propose a heuristic method to obtain approximate solutions. The heuristic comprises two stages: In the first stage, a Mixed Integer Quadratic Program (MIQP), similar in construction to the Quadratic Programming (QP) sub-problems in Sequential Quadratic Programming (SQP), is solved for the combinatorial part of the solution. In the second stage, the combinatorial part of the solution is held fixed, and the optimal state and control trajectories for the vehicles are obtained by solving a Nonlinear Program (NLP). The performance of the algorithm is demonstrated by a simulation of a non-trivial problem instance.

关键词： Roads Optimal control approximation algorithms Trajectory Quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Reachable Set approximation as a Non-Cooperative Multi-Agent Coverage Game

Reachable Set Approximation as a Non-Cooperative Multi-Agent...

引用

IEEE Conference on Decision and Control

作者： Fat-Hy Omar Rajab Jeff S. Shamma Department of Industrial Enterprise Systems Engineering The Grainger College of Engineering University of Illinois at Urbana-Champaign Urbana IL USA

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

We estimate the reachable set of a dynamical system by posing reachable set construction as a multi-agent coverage problem. As the terminology implies, the reachable set is the set of all states that can be reached within a specified time, using exogenous inputs with a specified bound, and starting from a specified initial condition. In multi-agent coverage, mobile agents self-deploy in an online manner to cover a region that is unknown a priori. The mapping between the two settings is the unknown region being the reachable set. Using time discretization and randomized spatial discretization, the proposed algorithm simultaneously generates a finite graph contained within the true reachable set and deploys the agents to optimally cover the graph. The utilized game-theoretic methods assure that, asymptotically, the agents self-deploy in a manner that provides optimal coverage with high probability. The accuracy of the approximation of the reachable set depends on the temporal and spacial discretization. The proposed algorithm is illustrated on different dynamical systems, where the performance is compared to related scenario-based approaches to reachable set estimation.

关键词： Terminology Heuristic algorithms Mobile agents Estimation Games Parallel processing approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Parameterized Maximum Node-Disjoint Paths

arXiv

引用

arXiv 2024年

作者： Lampis, Michael Vasilakis, Manolis Université Paris-Dauphine PSL University CNRS UMR7243 LAMSADE Paris France

We revisit the Maximum Node-Disjoint Paths problem, the natural optimization version of the famous Node-Disjoint Paths problem, where we are given a graph G, k (demand) pairs of vertices (si, ti), and an integer , and are asked whether there exist at least vertex-disjoint paths in G whose endpoints are given pairs. This problem has been intensely studied from both the approximation and parameterized complexity point of view and is notably known to be intractable by standard structural parameters, such as tree-depth, as well as the combined parameter plus pathwidth. We present several results improving and clarifying this state of the art, with an emphasis towards FPT approximation. Our main positive contribution is to show that the problem's intractability can be overcome using approximation: We show that for several of the structural parameters for which the problem is hard, most notably tree-depth, the problem admits an efficient FPT approximation scheme, returning a (1 − Ε)-approximate solution in time f(td, Ε)nO(1). We manage to obtain these results by comprehensively mapping out the structural parameters for which the problem is FPT if is also a parameter, hence showing that understanding as a parameter is key to the problem's approximability. This, in turn, is a problem we are able to solve via a surprisingly simple color-coding algorithm, which relies on identifying an insightful problem-specific variant of the natural parameter, namely the number of vertices used in the solution. The results above are quite encouraging, as they indicate that in some situations where the problem does not admit an FPT algorithm, it is still solvable almost to optimality in FPT time. A natural question is whether the FPT approximation algorithm we devised for tree-depth can be extended to pathwidth. We resolve this negatively, showing that under the Parameterized Inapproximability Hypothesis no FPT approximation scheme for this parameter is possible, even in time f(pw, Ε)ng(Ε).

关键词： approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Max-Min Throughput Design for Wireless Body Area Network with Backscatter Communication

Max-Min Throughput Design for Wireless Body Area Network wit...

引用

International Conference on Computer and Communications (ICCC)

作者： Shilong Zhou Bing Ning Jianjun Li Yulei Dong Huaibing Peng Shuang Li School of Information and Communication Engineering Zhongyuan University of Technology Zhengzhou China

ISBN: (数字)9798331507077

ISBN: (纸本)9798331507084

Recently, wireless body area network (WBAN) has become a prospective body monitoring system that can provide stable health services. In this paper, we propose a WBAN assisted by the backscatter communication (Backcom). In order to improve the throughput and ensure the fairness and quality of service (Qos) during the backscatter period, we investigate a throughput optimization problem based on the max-min fairness principle and introduce the robustness constraints. Because we jointly optimize the transmission power of access point (AP), backscattering coefficient, and backscattering time of the WBAN, making the optimization problem non-convex caused by the coupled variables. Therefore, we use the slack variable method and the successive convex approximation (SCA) method to convert the non-convex problem into convex. Simulation results show that compared to the traditional sum throughput algorithm and the linear energy harvested model, our proposed algorithm brings better fairness and robustness.

关键词： Wireless communication Simulation Quality of service Minimax techniques Throughput Body area networks approximation algorithms Robustness Optimization Backscatter

来源：评论

学校读者我要写书评

暂无评论

TPE: Trajectory Path Encoding for Anonymous Routing Algorithm in NoC-based Systems

TPE: Trajectory Path Encoding for Anonymous Routing Algorith...

引用

IEEE Asia-Pacific Conference on Circuits and Systems

作者： Kun-Chih Jimmy Chen Ting-En Kao Li-Heng Ke Institute of Electronics National Yang Ming Chiao Tung University Taiwan Department of Computer Science and Engineering National Sun Yat-sen University Taiwan

ISBN: (数字)9798350378771

ISBN: (纸本)9798350378788

The use of Network on Chip (NoC) in multi-core systems offers a flexible and scalable interconnection framework. However, concerns have been raised about Hardware Trojans (HT) due to the decentralized supply chain caused by globalization, especially in relation to third-party Intellectual Property (M3PIP). Of various HT attacks, eavesdropping is particularly worrisome as it operates with minimal power consumption and does not immediately disrupt system operations, compromising the reliability of NoC. Current research often focuses on packet payload encryption, overlooking potential risks associated with unsecured packet headers. To address this, we propose the Trajectory Path Encoding method, which establishes transport layer anonymity by substituting packet header details with specialized encoding based on the packet’s routing path. This method aims to prevent eavesdropping attacks and minimize data leakage. The approach involves encoding packets at the Network Interface (NI) and decoding them at the Router to enable anonymous transmission. Experimental results have shown a significant reduction in overall transmission latency up to 73.4% compared to related works. Additionally, when compared to the baseline design achieving an average overall reduction of approximately 79.7% in data leakage.

关键词： Power demand Systems operation Supply chains Routing approximation algorithms Encoding Trajectory Trojan horses Reliability Eavesdropping

来源：评论

学校读者我要写书评

暂无评论

Trade-Off between Performance and Power Consumption in Deep Learning Training

Trade-Off between Performance and Power Consumption in Deep ...

引用

Computer Engineering and Intelligent Communications (ISCEIC), International Symposium on

作者： Yuan Yao Yang Xiao School of Computer Science and Engineering Wuhan Institute of Technology Wuhan China

ISBN: (数字)9798331518677

ISBN: (纸本)9798331518684

The rapid advancement of deep learning technologies has transformed various sectors, enabling sophisticated applications across industries. However, training deep learning models is an energy-intensive process, leading to significant power consumption and associated costs. This paper investigates the inherent trade-off between power consumption and average waiting time in systems managing multiple job classes during model training. Recognizing that not all training jobs are created equal, we propose a systematic approach to optimize power usage by adjusting GPU power limits based on job urgency. Leveraging matrix geometric approximation, we develop an algorithm to compute mean sojourn times and average power consumption, demonstrating its effectiveness through experimental validation and simulations. Our findings reveal the existence of a power-performance trade-off, offering valuable insights for practitioners seeking to balance computational efficiency with energy sustainability in deep learning workflows.

关键词： Training Deep learning Industries Power demand Systematics Costs Computational modeling Graphics processing units approximation algorithms Sustainable development

来源：评论

学校读者我要写书评

暂无评论

Cooperative Multicast for Multi-Connected XR Devices with Joint HARQ Processing

Cooperative Multicast for Multi-Connected XR Devices with Jo...

引用

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

作者： Muhammad Ahsen Boyan Yanakiev Claudio Rosa Carles Navarro Manchon Ramoni Adeogun Department of Electronic Systems Aalborg University Aalborg Denmark Nokia Aalborg Denmark

ISBN: (数字)9798350362244

ISBN: (纸本)9798350362251

In this paper, we investigate the multi-connectivity for Extended Reality (XR) devices, having both a direct link and an indirect link to the same Next-Generation Node B (gNodeB). The indirect link is established through a cooperating 5th generation (5G) tethering device positioned in proximity to the XR device. Our study focuses on point-to-multipoint (PTM) multicast transmission to the XR device and the nearby 5G tethering device, emphasizing their cooperative interaction. We conduct this investigation under a spatially consistent channel model, quantifying the performance in terms of block error rate (BLER). Furthermore, we propose algorithms for processing joint hybrid automatic repeat request (HARQ) feedback (FB) in 5G multicast sessions. These algorithms are designed for multicast sessions, where User Equipment (UE)s actively cooperate, aiming to enhance the spectral efficiency of multiconnected XR devices by minimizing HARQ retransmissions. The resulting increase in spectral efficiency contributes to the overall capacity improvement of the network. Our link-level simulations demonstrate that multi-connectivity for XR yields a 0.8 dB gain for a 10% BLER target. Additionally, the proposed joint HARQ FB processing algorithm provides approximately a 7% gain in spectral efficiency.

关键词： Performance evaluation Multicast algorithms Spectral efficiency 5G mobile communication Unicast approximation algorithms User experience Gain Standards Signal to noise ratio

来源：评论

学校读者我要写书评

暂无评论

PAC Learnability for Reliable Communication Over Discrete Memoryless Channels

PAC Learnability for Reliable Communication Over Discrete Me...

引用

IEEE International Symposium on Information Theory

作者： Jiakun Liu Wenyi Zhang H. Vincent Poor Department of Electronic Engineering and Information Science University of Science and Technology of China Hefei China Department of Electrical Engineering Princeton University Princeton NJ USA

ISBN: (数字)9798350382846

ISBN: (纸本)9798350382853

In practical communication systems, knowledge of channel models is often absent, and consequently, transceivers need be designed based on empirical data. In this work, we study data-driven approaches to reliably choosing decoding metrics and code rates that facilitate reliable communication over unknown discrete memoryless channels (DMCs). Our analysis is inspired by the PAC (probably approximately correct) learning theory and does not rely on any assumptions on the statistical characteristics of DMCs. We show that a naive plug-in algorithm for choosing decoding metrics is likely to fail for finite training sets. We propose an alternative algorithm called the virtual sample algorithm and establish a non-asymptotic lower bound on its performance. The virtual sample algorithm is then used as a building block for constructing a learning algorithm that chooses a decoding metric and a code rate using which a transmitter and a receiver can reliably communicate at a rate arbitrarily close to the channel mutual information. Therefore, we conclude that DMCs are PAC learnable.

关键词： Measurement Training Monte Carlo methods Codes Transmitters Reliability theory approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Simulation and Optimization Method for Machine Tool Motion Trajectory Based on Digital Twins

A Simulation and Optimization Method for Machine Tool Motion...

引用

Information and Communication Technology (ICTech), International Conference of

作者： Cong Wu Li Peng Zhang Dong Yu Shenyang Institute of Computing Technology Chinese Academy of Sciences University of Chinese Academy of Sciences Shenyang China Shenyang Institute of Computing Technology Chinese Academy of Sciences Shenyang CASNC Technology Co. Ltd. Shenyang China

ISBN: (数字)9798350376258

ISBN: (纸本)9798350376265

In order to solve the problem that sudden changes in velocity and acceleration at the corners of adjacent segments during high-speed machining of tiny line segments can lead to motor vibration and tool over-cutting, a machine trajectory monitoring and optimization method based on digital twin simulation and adaptive local polynomial interpolation algorithm is proposed. The digital twin simulation system is set up to monitor the trajectory and speed of the machine tool during machining, and the adaptive fifth degree polynomial is used to fit the corner trajectory when there is a sudden change of speed or acceleration at the corner of the machining trajectory, and then the curve interpolation is carried out by using the fitted curves, so as to improve the stability and accuracy of machining. In the experiment, a digital twin simulation system is established based on four elements of the Agent, and then the runtime data of the physical machine tool is collected through the protocol. Finally, the trajectory is optimized using the polynomial interpolation algorithm. A digital twin simulation system for Turn-milling machines is established to validate the functionality

关键词： Interpolation Optimization methods Machining approximation error approximation algorithms Polynomials Trajectory Digital twins Machine tools Monitoring

来源：评论

学校读者我要写书评

暂无评论

Optimizing Photovoltaic Systems with an Incremental Conductance Algorithm

Optimizing Photovoltaic Systems with an Incremental Conducta...

引用

IEEE International Conference on Control System, Computing and Engineering (ICCSCE)

作者： Muhammad Haziq Haiqal Yahaya Ahmad Asri Abd Samat Samshul Munir Muhamad Muhammad Nabil Afiq Nor Azari Mohamad Adha Mohamad Idin Mohd Muzafa Jumidali Centre for Electrical Engineering Studies Universiti Teknologi MARA Cawangan Pulau Pinang Kampus Permatang Pauh Permatang Pauh Malaysia Department of Applied Sciences Universiti Teknologi MARA Cawangan Pulau Pinang Kampus Permatang Pauh Permatang Pauh Malaysia

ISBN: (数字)9798350364507

ISBN: (纸本)9798350364514

The primary objective of this study is to develop and evaluate an Incremental Conductance (InC) technique for Maximum Power Point Tracking (MPPT), in conjunction with a boost converter, to enhance the power generation efficiency of photovoltaic (PV) systems. The research aims to evaluate the performance of the $\mathrm{I n C}$ technique under different amounts of sunlight to replicate real-world situations. The objective is to identify and improve the disadvantages of traditional MPPT approaches by developing a more flexible and responsive approach to environmental fluctuations. The project utilises MATLAB/Simulink to simulate a dynamic system that regulates a DC-DC boost converter’s duty cycle to optimise power output. The core findings demonstrate significant improvements in efficiency and flexibility, as the InC MPPT technique effectively tracks the maximum power point (MPP) and keeps consistent performance despite varying conditions. This indicates the potential for improved dependability and durability in photovoltaic installations, promoting broader use in renewable energy initiatives.

关键词： Maximum power point trackers Photovoltaic systems Renewable energy sources Fluctuations Solar energy approximation algorithms Reliability engineering Object recognition Sustainable development Matlab

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：