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

43rd International Conference of the Chilean Computer Science Society, SCCC 2024

作者： Schaa, Hans del Solar-Zavala, Jose A. Barriga, Nicolas A. Universidad de Talca Doctoral Program in Engineering Systems Curicó Chile Universidad de Talca Faculty of Engineering Talca Chile

ISBN: (纸本)9798331527891

Knowing if a Sokoban level has a solution requires a high investment of computational resources. This also happens when estimating difficulty;heuristics may not be precise, only work for simplified cases, be discontinuous and take much computing time. The calculation of high-fidelity heuristics is expensive and the performance of optimization systems is reduced by the time they take to deliver the result. In this article, two Convolutional Neural Networks (CNN) are implemented, a classifier of resolvable Sokoban boards and a regressor that predicts the number of pushes necessary to solve them. These obtained an accuracy of 79 % and MAE of 28, respectively. Trained models are useful in systems that do not require optimality, but rather guidance within the search space that balances time and quality. These networks can be used as surrogate methods, replacing high-fidelity heuristics that take too long. © 2024 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Using Entropy for Modeling Difficulty in the Asteroid Escape Sliding Puzzle

Using Entropy for Modeling Difficulty in the Asteroid Escape...

引用

2023 IEEE CHILEAN Conference on Electrical, Electronics engineering, Information and Communication Technologies, ChileCon 2023

作者： del Solar-Zavala, Jose A. Schaa, Hans Barriga, Nicolas A. Doctoral Program in Engineering Systems Universidad de Talca Curicó Chile Universidad de Talca Faculty of Engineering Talca Chile

ISBN: (纸本)9798350369533

developing a standarized metric for difficulty that can be applied to a large number of puzzles is not trivial. This does not come as a surprise because of the subjective factors involved in defining difficulty. However, studies that address the design and application of metrics that can be applied to multiple games are still important, because they can still be used to increase the quality of content generated by automated agents. We take a look at applying information entropy concepts in the game Asteroid Escape and compare the results with other metrics to assess difficulty used in games of similar characteristics. This approach is largely based on future work proposal from a previous study done on The Witness puzzles that yielded positive results on using an automatic method to assess the difficulty of user rated puzzles. This study also includes a modification of BFS and A∗ capable of finding every shortest solution. From the implementation, it is possible to look at contradicting results with the literature, where basic metrics had a better result correlating with an official definition of difficulty from the game designers. The impact expected from this study is to propose an update to the the corpus of puzzle games where the uncertainty metric for difficulty has been applied. As having an accurate assessment of difficulty can open the doors to other studies, such as improving the quality of the output from procedural content generation methods in games or propose an automated method of difficulty adjustment based on this metric. © 2023 IEEE.

关键词： Asteroids

来源：评论

学校读者我要写书评

暂无评论

Evaluating Standard Search Enhancements Performance in Zen Puzzle Garden

Evaluating Standard Search Enhancements Performance in Zen P...

引用

2023 IEEE CHILEAN Conference on Electrical, Electronics engineering, Information and Communication Technologies, ChileCon 2023

作者： Schaa, Hans del Solar-Zavala, Jose A. Barriga, Nicolas A. Doctoral Program in Engineering Systems Universidad de Talca Curico Chile Universidad de Talca Faculty of Engineering Talca Chile

ISBN: (纸本)9798350369533

Sokoban-type puzzles and their variants involve complex planning and decision-making challenges in wide and deep search spaces. Such scenarios are interesting for testing path-planning algorithms. This document uses A ∗ and IDA ∗ (Iterative deepening A *) algorithms to solve Zen Puzzle Garden game boards;a Sokoban-type puzzle where you need rake the sandy area completely. The algorithms are evaluated in terms of speed and node expansion in moderately complex boards. Additionally, we implement three improvements: transposition tables, move ordering, and deadlock tables. The results show that IDA ∗ with the three proposed improvements is on average faster than A *. Although its strength is its low memory usage, it can be seen that it is very competitive versus A ∗ in terms of time usage. Transposition tables and deadlocks tables reduce by 500 times the number of nodes expanded by the IDA ∗ without improvements. On the other hand, the ordering of nodes is not very effective for some boards, which causes a worse performance of the IDA ∗ algorithm, giving rise to greater exploration in boards that do not lead to the solution. Studying these algorithms can be beneficial in the field of path-finding for Sokoban-type game domains or solver-based procedural content generators. © 2023 IEEE.

关键词： decision making

来源：评论

学校读者我要写书评

暂无评论

Optimal Indirect Power Predictive Controller in the Alpha-Beta Reference Frame for Grid-Connected Converters

Optimal Indirect Power Predictive Controller in the Alpha-Be...

引用

2019 FISE-IEEE/CIGRE Conference - Living the Energy Transition, FISE/CIGRE 2019

作者： Murillo-Yarce, D. Marulanda-Durango, J.J. Mejía, A. Escobar Alzatc-Gómez, A. Engineering Systems Faculty of Engineering Universidad de Talca Curicó Chile Electrical Engineering Graduate and Undergraduate Program Universidad Tecnológica de Pereira Pereira Colombia

ISBN: (纸本)9781728142302

This article presents an indirect power predictive optimal controller applicable to grid-connected converters. The VSI converter is used as an interface between distributed generators, energy storage systems and the ac-grid. The objective of the research project is to develop a controller with high static and dynamic features, that performs with low computational burden and low switching stress. The first step to develop the controller is to select the appropiate reference frame. The αβ frame is used for its simple structure and easy implementation. Then, the proposed methodology consider the controller performance to define the sampling period, the prediction horizon and the switching pattern. Results show that an increment in the sampling period results in a major harmonic content, and if the prediction horizon increases, the number of calculations is higher without improving the controller performance. The main features of the proposed controller are: low sampling times and a two-steps prediction horizon. With these features the VSI efficiency rises, while the systems's losses and harmonic distortion are reduced. © 2019 IEEE.

关键词： Controllers

来源：评论

学校读者我要写书评

暂无评论

Using Entropy for Modeling Difficulty in the Asteroid Escape Sliding Puzzle

Using Entropy for Modeling Difficulty in the Asteroid Escape...

引用

CHILEAN Conference on Electrical, Electronics engineering, Information and Communication Technologies (CHILECON)

作者： Jose A. del Solar-Zavala Hans Schaa Nicolas A. Barriga Doctoral Program in Engineering Systems Universidad de Talca Curicó Chile Faculty of Engineering Universidad de Talca Talca Chile

developing a standarized metric for difficulty that can be applied to a large number of puzzles is not trivial. This does not come as a surprise because of the subjective factors involved in defining difficulty. However, studies that address the design and application of metrics that can be applied to multiple games are still important, because they can still be used to increase the quality of content generated by automated agents. We take a look at applying information entropy concepts in the game Asteroid Escape and compare the results with other metrics to assess difficulty used in games of similar characteristics. This approach is largely based on future work proposal from a previous study done on The Witness puzzles that yielded positive results on using an automatic method to assess the difficulty of user rated puzzles. This study also includes a modification of BFS and A* capable of finding every shortest solution. From the implementation, it is possible to look at contradicting results with the literature, where basic metrics had a better result correlating with an official definition of difficulty from the game designers. The impact expected from this study is to propose an update to the the corpus of puzzle games where the uncertainty metric for difficulty has been applied. As having an accurate assessment of difficulty can open the doors to other studies, such as improving the quality of the output from procedural content generation methods in games or propose an automated method of difficulty adjustment based on this metric.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Predicting Solvability and Difficulty of Sokoban Puzzles

Predicting Solvability and Difficulty of Sokoban Puzzles

引用

Computer Science Society (SCCC) International Conference Chilean

作者： Hans Schaa Jose A. del Solar-Zavala Nicolas A. Barriga Doctoral Program in Engineering Systems Universidad de Talca Curicó Chile Faculty of Engineering Universidad de Talca Talca Chile

ISBN: (数字)9798331527891

ISBN: (纸本)9798331527907

Knowing if a Sokoban level has a solution requires a high investment of computational resources. This also happens when estimating difficulty; heuristics may not be precise, only work for simplified cases, be discontinuous and take much computing time. The calculation of high-fidelity heuristics is expensive and the performance of optimization systems is reduced by the time they take to deliver the result. In this article, two Convolutional Neural Networks (CNN) are implemented, a classifier of resolvable Sokoban boards and a regressor that predicts the number of pushes necessary to solve them. These obtained an accuracy of 79 % and MAE of 28, respectively. Trained models are useful in systems that do not require optimality, but rather guidance within the search space that balances time and quality. These networks can be used as surrogate methods, replacing high-fidelity heuristics that take too long.

关键词： Computer science Accuracy Convolutional neural networks Optimization Investment

来源：评论

学校读者我要写书评

暂无评论

Evaluating Standard Search Enhancements Performance in Zen Puzzle Garden

Evaluating Standard Search Enhancements Performance in Zen P...

引用

CHILEAN Conference on Electrical, Electronics engineering, Information and Communication Technologies (CHILECON)

作者： Hans Schaa Jose A. del Solar-Zavala Nicolas A. Barriga Doctoral Program in Engineering Systems Universidad de Talca Curicò Chile Faculty of Engineering Universidad de Talca Talca Chile

Sokoban-type puzzles and their variants involve complex planning and decision-making challenges in wide and deep search spaces. Such scenarios are interesting for testing path-planning algorithms. This document uses A * and IDA * (Iterative deepening A *) algorithms to solve Zen Puzzle Garden game boards; a Sokoban-type puzzle where you need rake the sandy area completely. The algorithms are evaluated in terms of speed and node expansion in moderately complex boards. Additionally, we implement three improvements: transposition tables, move ordering, and deadlock tables. The results show that IDA * with the three proposed improvements is on average faster than A *. Although its strength is its low memory usage, it can be seen that it is very competitive versus A * in terms of time usage. Transposition tables and deadlocks tables reduce by 500 times the number of nodes expanded by the IDA * without improvements. On the other hand, the ordering of nodes is not very effective for some boards, which causes a worse performance of the IDA * algorithm, giving rise to greater exploration in boards that do not lead to the solution. Studying these algorithms can be beneficial in the field of path-finding for Sokoban-type game domains or solver-based procedural content generators.

关键词：

来源：评论

学校读者我要写书评

暂无评论

On a Pickup to delivery Drone Routing Problem: Models and Algorithms

SSRN

引用

SSRN 2022年

作者： Candia-Véjar, Alfredo Gómez-Lagos, Javier Rojas-Espinoza, Benjamín Doctoral Program in Engineering Systems Faculty of Enginnering Universidad de Talca Curicó3340000 Chile School of Civil Industrial Engineering Faculty of Engineering Universidad de Talca Curicó3340000 Chile Dept. of Industrial Engineering Faculty of Engineering Universidad de Talca Curicó3340000 Chile

We present a new variant of the Pickup and delivery Routing problem. Given a set of customers, facilities, a depot, and a homogeneous fleet of drones, the Pickup to delivery Drone Routing Problem (PDDRP) aims to find a drone scheduling such that a drone serves the customer’s order from a set of available facilities. Each drone starts in the depot, flies to pick the customer’s order in a facility, and continues its flight to deliver the parcel to a customer. Then, the drone begins another service, and once its last service is completed, it returns to the depot. The objective is to minimize the makespan associated with the drone fleet. The layer of facilities forcing drones to visit one of them to pick the parcel makes the problem different from traditional pickup and delivery routing problems. We present threemixed-linear programming models to obtain optimal solutions for the problem. The first model is related to the multiple Traveling Salesman Problem (m-TSP), the second is associated with the Parallel Machine Scheduling Problem (PMS), and the third was developed specifically for the new *** the high computational complexity of the PDDRP, we design a Greedy Randomized Adaptive Search Procedure (GRASP) to find near-optimal solutions when exact approaches cannot achieve (near) optimal solutions. Computational experiments show that a commercial solver could solve only small problem instances. GRASP can find reasonable solutions in a short time when medium and large instance sizes need to be solved. Finally, we show that some routing problems for delivery, allowing truck-drone collaboration, could be formulated as an extension of PMS. © 2022, The Authors. All rights reserved.

关键词： Pickups

来源：评论

学校读者我要写书评

暂无评论

Photovoltaic Microinverter with Hybrid Energy Storage System (HESS) and Virtual Impedance Control for Injection into a Microgrid

Photovoltaic Microinverter with Hybrid Energy Storage System...

引用

IEEE Annual Southern Power Electronics Conference (SPEC)

作者： Patricio Gaisse Javier Muñoz Marco Rivera Carlos Restrepo Galina Mirzaeva Engineering Systems Doctoral Program Faculty of Engineering University of Talca Curicó Chile Department of Electrical Engineering Faculty of Engineering Universidad de Talca Curicó Chile Doctorate in Engineering Systems Faculty of Engineering Universidad de Talca Curicó Chile School of Electrical Engineering and Computer Science The University of Newcastle Callaghan NSW Australia

In this work, a photovoltaic (PV) microinverter is developed, which includes an hybrid energy storage system based on a battery and an ultracapacitor that are connected in parallel to the dc-link through two buck-boost bidirectional converters. The PV panel is connected in parallel to dc-link through an unidirectional boost converter. For the dc-ac stage, a two-stage Flyback / H-bridge inverter will be considered, which will be used to inject the available power into a microgrid. The study proposes the necessary control strategies to manage the power flow according to generation and injection conditions, where a virtual impedance loop is incorporated in the control of the energy storage elements. The presented results confirm the suitability of the proposed strategy.

关键词： Photovoltaic systems Microgrids Hybrid power systems Batteries Circuit stability Topology Impedance

来源：评论

学校读者我要写书评

暂无评论

Power Sharing Control of Islanded AC Microgrid Considering Droop Control and Virtual Impedance

Power Sharing Control of Islanded AC Microgrid Considering D...

引用

IEEE International Conference on Industrial Technology (ICIT)

作者： Ariel Villalón Carlos Muñoz Rodrigo Aliaga Javier Muñoz Marco Rivera Pericle Zanchetta Doctorate in Engineering Systems Program Faculty of Engineering Universidad de Talca Curicó Chile Universidad de Talca Curicó Chile University of Nottingham Nottingham U.K.

ISBN: (数字)9781728157542

ISBN: (纸本)9781728157559

Microgrids appear as the key part of the future power systems that include distributed generators, renewable energy, and energy storage. In this paper a decentralized power sharing control scheme that includes droop control with virtual impedances with PI controllers for the voltage and current is proposed for an islanded AC microgrid with two voltage source inverters in parallel that share a residential load. To avoid circulating currents and unbalanced power sharing due to line impedance differences in the microgrid, virtual impedances are added. The proposed control scheme is implemented in MAT-LAB/Simulink to prove the proper operation under inductive behavior and mismatches in the line impedances of the microgrid system.

关键词： Microgrids Impedance Voltage control Inverters Frequency control Reactive power Inductors

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：