2016 13th International Workshop on Discrete Event Systems (WODES)最新文献_第2页

Comparing MILP, CP, and A* for multiple stacker crane scheduling 多垛机调度的MILP、CP和A*的比较

2016 13th International Workshop on Discrete Event Systems (WODES) Pub Date : 2016-05-01 DOI: 10.1109/WODES.2016.7497827

Fredrik Hagebring, Oskar Wigström, B. Lennartson, S. Ware, R. Su

{"title":"Comparing MILP, CP, and A* for multiple stacker crane scheduling","authors":"Fredrik Hagebring, Oskar Wigström, B. Lennartson, S. Ware, R. Su","doi":"10.1109/WODES.2016.7497827","DOIUrl":"https://doi.org/10.1109/WODES.2016.7497827","url":null,"abstract":"This paper describes an optimisation model for the scheduling of a system consisting of three stacker cranes that are restricted to the same track. To improve the efficiency of the solution methods, a novel simplification of the model is presented, which has a low impact on the quality of the solution but greatly decreases its complexity. This model is then used to benchmark several popular solution methods, including both optimal and approximate methods. Some are based on monolithic models, whereas others solve the problem in phases by using sub-problem formulations. The result presented in this paper shows that evaluated solution methods have complementary strengths and weaknesses. Constraint Programming (CP) is very efficient on small scale problems, while Mixed Integer Linear Programming (MILP) scales much better when the number of movement orders increases. However, none of these methods are able to solve large instances of the problem to optimality. To handle the complexity of the problem, approximate solution methods are the only viable option. In this paper we show that promising results can be obtained even with simple methods using well known search algorithms such as A* and Tabu-search. However, preliminary results on more advanced search algorithms show that further improvements may be achieved, allowing the solution of very large problem instances.","PeriodicalId":268613,"journal":{"name":"2016 13th International Workshop on Discrete Event Systems (WODES)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127514791","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 3

Robust controllers in disturbance decoupling of uncertain max-plus linear systems: an application to a high throughput screening system for drug discovery 不确定最大+线性系统扰动解耦中的鲁棒控制器:在药物发现高通量筛选系统中的应用

2016 13th International Workshop on Discrete Event Systems (WODES) Pub Date : 2016-05-01 DOI: 10.1109/WODES.2016.7497880

Y. Shang, L. Hardouin, M. Lhommeau, C. Maia

引用次数: 6

Efficient algorithm for quay crane scheduling with arbitrary precedence constraint 具有任意优先约束的码头起重机调度算法

2016 13th International Workshop on Discrete Event Systems (WODES) Pub Date : 2016-05-01 DOI: 10.1109/WODES.2016.7497826

Ming Liu, Lujun Xu, Shijin Wang, C. Chu

引用次数: 1

Fault-tolerant control of deterministic I/O automata with ambiguous diagnostic result 具有模糊诊断结果的确定性I/O自动机容错控制

2016 13th International Workshop on Discrete Event Systems (WODES) Pub Date : 2016-05-01 DOI: 10.1109/WODES.2016.7497856

M. Schuh, J. Lunze

引用次数: 3

Deadlock-free scheduling for timed Petri net models combined with MPC and backtracking 结合MPC和回溯的Petri网模型无死锁调度

2016 13th International Workshop on Discrete Event Systems (WODES) Pub Date : 2016-05-01 DOI: 10.1109/WODES.2016.7497889

D. Lefebvre

引用次数: 15

Optimal scheduling of time-constrained single-arm cluster tools with wafer revisiting 考虑晶圆重访的单臂集束工具的优化调度

2016 13th International Workshop on Discrete Event Systems (WODES) Pub Date : 2016-05-01 DOI: 10.1109/WODES.2016.7497872

Zicheng Liu, N. Wu, Fajun Yang, Yan Qiao

引用次数: 2

Automated service composition via supervisory control theory 基于监督控制理论的自动化服务组合

2016 13th International Workshop on Discrete Event Systems (WODES) Pub Date : 2016-05-01 DOI: 10.1109/WODES.2016.7497822

Francis Atampore, J. Dingel, K. Rudie

{"title":"Automated service composition via supervisory control theory","authors":"Francis Atampore, J. Dingel, K. Rudie","doi":"10.1109/WODES.2016.7497822","DOIUrl":"https://doi.org/10.1109/WODES.2016.7497822","url":null,"abstract":"Web services play a major role in electronic businesses and allow organizations to perform certain business activities in a distributed fashion. In some circumstances, a single service is not able to perform certain tasks and it becomes imperative to compose two or more services in order to complete a task. While approaches to tackle such a problem are known, the task of generating provably correct Web service compositions still remain challenging and complex. In this paper, we develop a supervisory control framework for automated composition of Web services. Labelled Transition Systems augmented with guards and data variables are used to represent a given set of Web service specifications. We model the interactions of services asynchronously and we use guards and data variables to allow us to express certain preconditions which are then propagated from the system requirements through the overall composite service. The objective of our framework is to synthesize a controller, which interacts with a given set of Web services through messages to guarantee that a given specification is satisfied. A key novelty of this work is the application of control theory to service-oriented computing and the incorporation of run-time input into the supervisor generation process.","PeriodicalId":268613,"journal":{"name":"2016 13th International Workshop on Discrete Event Systems (WODES)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125640450","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 10

Graph transformation as a modelling framework for supervisory control 图变换作为监控的建模框架

2016 13th International Workshop on Discrete Event Systems (WODES) Pub Date : 2016-05-01 DOI: 10.1109/WODES.2016.7497834

Jeremie Benhamron, J. G. Thistle

引用次数: 0

Receding-horizon control for max-plus linear systems with discrete actions using optimistic planning 具有离散作用的最大+线性系统的最优控制

2016 13th International Workshop on Discrete Event Systems (WODES) Pub Date : 2016-05-01 DOI: 10.1109/WODES.2016.7497879

Jia Xu, L. Buşoniu, T. Boom, B. Schutter

{"title":"Receding-horizon control for max-plus linear systems with discrete actions using optimistic planning","authors":"Jia Xu, L. Buşoniu, T. Boom, B. Schutter","doi":"10.1109/WODES.2016.7497879","DOIUrl":"https://doi.org/10.1109/WODES.2016.7497879","url":null,"abstract":"This paper addresses the infinite-horizon optimal control problem for max-plus linear systems where the considered objective function is a sum of discounted stage costs over an infinite horizon. The minimization problem of the cost function is equivalently transformed into a maximization problem of a reward function. The resulting optimal control problem is solved based on an optimistic planning algorithm. The control variables are the increments of system inputs and the action space is discretized as a finite set. Given a finite computational budget, a control sequence is returned by the optimistic planning algorithm. The first control action or a subsequence of the returned control sequence is applied to the system and then a receding-horizon scheme is adopted. The proposed optimistic planning approach allows us to limit the computational budget and also yields a characterization of the level of near-optimality of the resulting solution. The effectiveness of the approach is illustrated with a numerical example. The results show that the optimistic planning approach results in a lower tracking error compared with a finite-horizon approach when a subsequence of the returned control sequence is applied.","PeriodicalId":268613,"journal":{"name":"2016 13th International Workshop on Discrete Event Systems (WODES)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114321616","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A new linear constraint transformation approach for Petri nets with uncontrollable transitions 具有不可控过渡的Petri网的一种新的线性约束变换方法

2016 13th International Workshop on Discrete Event Systems (WODES) Pub Date : 2016-05-01 DOI: 10.1109/WODES.2016.7497857

Dan You, Shouguang Wang, C. Seatzu

引用次数: 1