Pub Date : 2018-08-01DOI: 10.1109/COASE.2018.8560507
R. Maier, S. Unverdorben, M. Gepp
Developing cyber-physical systems (CPS) as well as cyber-physical production systems (CPPS), as a base for concepts like Industry 4.0 and smart factories, requires a close interaction between several engineering disciplines. However, efficient collaboration between the different technical disciplines and engineering tools remains a challenge. Especially the seamless and automated information exchange between tools is seen as one of the core problems to be solved on the way to Industry 4.0. Current state of the art approaches are relying on task automation functionalities embedded in single tools and on tool independent approaches that use physical addresses to handle data. The main challenge regarding these state of the art tools is that the needs of Industry 4.0 with respect to flexibility and efficiency can't be fulfilled. In order to overcome these challenges a new task automation approach is introduced. Compared to today's approaches this new approach supports logical addressing of data based on taxonomic ordering schemes, flexible usage of best fitting base techniques, predefined tool specific interface functions as well as self aware task execution. The new approach offers the advantage of exchanging data between tools, supporting dynamic workflows, automating tasks, and easily implementing extensions. Several tasks in the areas of data or document generation, mass data handling, seamless tool usage and automated decision making, have already been implemented and were proven to work.
{"title":"Efficient Implementation of Task Automation to Support Multidisciplinary Engineering of CPS","authors":"R. Maier, S. Unverdorben, M. Gepp","doi":"10.1109/COASE.2018.8560507","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560507","url":null,"abstract":"Developing cyber-physical systems (CPS) as well as cyber-physical production systems (CPPS), as a base for concepts like Industry 4.0 and smart factories, requires a close interaction between several engineering disciplines. However, efficient collaboration between the different technical disciplines and engineering tools remains a challenge. Especially the seamless and automated information exchange between tools is seen as one of the core problems to be solved on the way to Industry 4.0. Current state of the art approaches are relying on task automation functionalities embedded in single tools and on tool independent approaches that use physical addresses to handle data. The main challenge regarding these state of the art tools is that the needs of Industry 4.0 with respect to flexibility and efficiency can't be fulfilled. In order to overcome these challenges a new task automation approach is introduced. Compared to today's approaches this new approach supports logical addressing of data based on taxonomic ordering schemes, flexible usage of best fitting base techniques, predefined tool specific interface functions as well as self aware task execution. The new approach offers the advantage of exchanging data between tools, supporting dynamic workflows, automating tasks, and easily implementing extensions. Several tasks in the areas of data or document generation, mass data handling, seamless tool usage and automated decision making, have already been implemented and were proven to work.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"15 1","pages":"1388-1393"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81964639","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}
Pub Date : 2018-08-01DOI: 10.1109/COASE.2018.8560592
Mengzhuo Yang, Liao Zhang, Peter O. Denno
While smart manufacturing is viewed as the future of manufacturing, core knowledge about manufacturing is still lacking in various areas and will continue to be one of the main challenges in research and development. In terms of manufacturing process flow, to be able to make justified production control decisions, it is necessary to be able to predict the system's performance and the effects of control actions on the part flow. This amounts to knowing the transient behavior of the production system. However, most of the available studies on production system transients assume Markov models, while the actual production practice often deviates from this assumption. Therefore, in this paper, we carry out preliminary investigation of the transient behavior of production systems with machines characterized by non-Markovian reliability models. Specifically, using discrete-event simulations, we study serial production lines with machines' up- and downtimes modeled by gamma random variables. System properties of several performance metrics during transients are then discussed based on numerical experiments and a Control Theory-based approach. We view this as a first step in understanding the transient behavior of production systems under more realistic mathematical models.
{"title":"Transients of Synchronous Serial Production Lines with Non-Exponential Reliability Machines","authors":"Mengzhuo Yang, Liao Zhang, Peter O. Denno","doi":"10.1109/COASE.2018.8560592","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560592","url":null,"abstract":"While smart manufacturing is viewed as the future of manufacturing, core knowledge about manufacturing is still lacking in various areas and will continue to be one of the main challenges in research and development. In terms of manufacturing process flow, to be able to make justified production control decisions, it is necessary to be able to predict the system's performance and the effects of control actions on the part flow. This amounts to knowing the transient behavior of the production system. However, most of the available studies on production system transients assume Markov models, while the actual production practice often deviates from this assumption. Therefore, in this paper, we carry out preliminary investigation of the transient behavior of production systems with machines characterized by non-Markovian reliability models. Specifically, using discrete-event simulations, we study serial production lines with machines' up- and downtimes modeled by gamma random variables. System properties of several performance metrics during transients are then discussed based on numerical experiments and a Control Theory-based approach. We view this as a first step in understanding the transient behavior of production systems under more realistic mathematical models.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"2014 1","pages":"1507-1512"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86485142","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}
Pub Date : 2018-08-01DOI: 10.1109/COASE.2018.8560531
G. Quirós, András Varró, P. Eisen, F. Roelofs, P. Kob
We consider the problem of adding a new machine to an existing production line with minimum engineering effort and downtime (e.g. for plug-and-produce). The supervising system and the new machine have interfaces which are similar but not fully compatible with each other, so the interfaces and interaction logic between these systems must be modified and adapted to ensure functionality and exploit the full potential of the new machine. This adaptation is currently done by hand, where a number of parameters and synchronization steps need to be checked by the engineer. We present an approach for detecting incompatibilities between production machine interfaces automatically. To match the parameters requested by the supervising system with the capabilities provided by the machine, we employ an augmented unification method stemming from logic programming. To analyze the synchronization and termination properties of the interaction, we employ graph algorithms on the synchronous cross product of finite state automata. We developed a software prototype and used it to evaluate the approach with example models. Our approach has the potential to optimize the process of machine addition and replacement and minimize potential failure by applying a zero-engineering approach.
{"title":"Automatic Skill Matching for Production Machines","authors":"G. Quirós, András Varró, P. Eisen, F. Roelofs, P. Kob","doi":"10.1109/COASE.2018.8560531","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560531","url":null,"abstract":"We consider the problem of adding a new machine to an existing production line with minimum engineering effort and downtime (e.g. for plug-and-produce). The supervising system and the new machine have interfaces which are similar but not fully compatible with each other, so the interfaces and interaction logic between these systems must be modified and adapted to ensure functionality and exploit the full potential of the new machine. This adaptation is currently done by hand, where a number of parameters and synchronization steps need to be checked by the engineer. We present an approach for detecting incompatibilities between production machine interfaces automatically. To match the parameters requested by the supervising system with the capabilities provided by the machine, we employ an augmented unification method stemming from logic programming. To analyze the synchronization and termination properties of the interaction, we employ graph algorithms on the synchronous cross product of finite state automata. We developed a software prototype and used it to evaluate the approach with example models. Our approach has the potential to optimize the process of machine addition and replacement and minimize potential failure by applying a zero-engineering approach.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"8 1","pages":"534-539"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88022821","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}
Pub Date : 2018-08-01DOI: 10.1109/COASE.2018.8560371
Shigang Li, Xiaowei Wang, T. Kosaki
While a spherical image has a full field of view with a low resolution with respect to observed scenes, a perspective image has a narrow field of view with a high resolution with respect to observed scenes. Therefore, a spherical image and a perspective image are complementary to each other for the field of view and resolution; a visual system consisting of a spherical image and a perspective image can not only observe the entire surrounding environment, but also focus on a specific object with high resolution. In this paper we investigate the computation of the homography between a spherical image and a perspective image. First, the conventional homography of perspective images is reformulated to the case associating a spherical image to a perspective image. Next, we explain how to carry out feature matching between a full-view image and a perspective image for the computation of the homography. Finally, the experimental results of two applications are given to show the effectiveness of our proposed method.
{"title":"Computation of Homography between a Spherical Image and a Perspective Image","authors":"Shigang Li, Xiaowei Wang, T. Kosaki","doi":"10.1109/COASE.2018.8560371","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560371","url":null,"abstract":"While a spherical image has a full field of view with a low resolution with respect to observed scenes, a perspective image has a narrow field of view with a high resolution with respect to observed scenes. Therefore, a spherical image and a perspective image are complementary to each other for the field of view and resolution; a visual system consisting of a spherical image and a perspective image can not only observe the entire surrounding environment, but also focus on a specific object with high resolution. In this paper we investigate the computation of the homography between a spherical image and a perspective image. First, the conventional homography of perspective images is reformulated to the case associating a spherical image to a perspective image. Next, we explain how to carry out feature matching between a full-view image and a perspective image for the computation of the homography. Finally, the experimental results of two applications are given to show the effectiveness of our proposed method.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"2 1","pages":"439-444"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85917917","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}
Pub Date : 2018-08-01DOI: 10.1109/COASE.2018.8560391
Philipp Marks, Timo Müller, D. Vögeli, Tobias Jung, N. Jazdi, M. Weyrich
The paradigm of multi-agent systems is used in various application scenarios like manufacturing control or multi-agent assistance systems that aim at providing assistance to the user of the system in a specific task or situation. With an increasing number of applications of multi agent assistance systems in the industrial automation domain, the different architectures of these applications can be compared and differences and similarities can be identified. This paper presents the results of the literature review of 18 agent-based assistance systems from different domains. Within the reviewed architectures, seven different agent types could be identified. In a further step, design patterns based on the application domain and the level of automation have been identified and discussed. These design patterns can be used to facilitate the development of future multi agent assistance systems.
{"title":"Agent Design Patterns for Assistance Systems in Various Domains - a Survey","authors":"Philipp Marks, Timo Müller, D. Vögeli, Tobias Jung, N. Jazdi, M. Weyrich","doi":"10.1109/COASE.2018.8560391","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560391","url":null,"abstract":"The paradigm of multi-agent systems is used in various application scenarios like manufacturing control or multi-agent assistance systems that aim at providing assistance to the user of the system in a specific task or situation. With an increasing number of applications of multi agent assistance systems in the industrial automation domain, the different architectures of these applications can be compared and differences and similarities can be identified. This paper presents the results of the literature review of 18 agent-based assistance systems from different domains. Within the reviewed architectures, seven different agent types could be identified. In a further step, design patterns based on the application domain and the level of automation have been identified and discussed. These design patterns can be used to facilitate the development of future multi agent assistance systems.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"43 1","pages":"168-173"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87863486","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}
Pub Date : 2018-08-01DOI: 10.1109/COASE.2018.8560403
Mengyi Zhang, A. Matta
Bottleneck of a manufacturing system is the resource with the largest sensitivity on the overall throughput. The bottleneck detection is an important problem for manufacturing system improvement. This work proposes a Downtime Bottleneck (DT-BN) detection approach of open flow lines based on the Discrete Event Optimization (DEO) modeling framework using field data. The DEO model enables to identify the machine whose downtime has the largest sensitivity, without calculating the sensitivities of all the machines. The DEO model is a mathematical programming representation of integrated sample-path simulation-optimization problem, i.e., the structure of simulation model is embedded with the optimization problem. The Benders decomposition is applied, and a simulation based cut generation approach is used, which reduces the computational effort without any approximation. Numerical results have shown that the proposed approach performs both effectively and efficiently. Furthermore, the effectiveness can be further improved by gathering a larger set of data, as the convergence of this approach is both proved theoretically in previous research and validated numerically in this work.
{"title":"Data-driven Downtime Bottleneck Detection in Open Flow Lines","authors":"Mengyi Zhang, A. Matta","doi":"10.1109/COASE.2018.8560403","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560403","url":null,"abstract":"Bottleneck of a manufacturing system is the resource with the largest sensitivity on the overall throughput. The bottleneck detection is an important problem for manufacturing system improvement. This work proposes a Downtime Bottleneck (DT-BN) detection approach of open flow lines based on the Discrete Event Optimization (DEO) modeling framework using field data. The DEO model enables to identify the machine whose downtime has the largest sensitivity, without calculating the sensitivities of all the machines. The DEO model is a mathematical programming representation of integrated sample-path simulation-optimization problem, i.e., the structure of simulation model is embedded with the optimization problem. The Benders decomposition is applied, and a simulation based cut generation approach is used, which reduces the computational effort without any approximation. Numerical results have shown that the proposed approach performs both effectively and efficiently. Furthermore, the effectiveness can be further improved by gathering a larger set of data, as the convergence of this approach is both proved theoretically in previous research and validated numerically in this work.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"135 1","pages":"1513-1518"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89016423","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}
Pub Date : 2018-08-01DOI: 10.1109/COASE.2018.8560448
M. Wimmer, Alexandra Mazak
Model-based engineering is an emerging paradigm to deal with the complexity of multi-disciplinary engineering in CPPS projects. In such projects, different kinds of models are created during the lifecycle of a production system. Automa-tionML is a promising standard to provide a unifying format to represent and connect the different engineering models. Dedicated tool support has been developed for AutomationML in the last years to create and evolve models. However, when it comes to querying AutomationML models, implementation-related query languages have to be currently used. These languages have a certain complexity as they are not directly based on the concepts of AutomationML but on the underlying technological concepts and encodings of AutomationML. This often hinders the formulation of automatically executable queries by domain experts. In this paper, we propose a dedicated query language for AutomationML called Automation Query Language (Au-tomationQL) which is directly derived from AutomationML. Using this query language, queries can be defined in a by-example manner which allows engineers to formulate queries in terms of AutomationML concepts instead of switching to an implementation-oriented query language. We illustrate how AutomationQL is defined, how queries can be formulated as well as how tool support is provided to automatically evaluate the queries and represent their results. Finally, we contrast our solution with existing query languages and derive a roadmap for future research on AutomationQL.
{"title":"From AutomationML to AutomationQL: A By-Example Query Language for CPPS Engineering Models","authors":"M. Wimmer, Alexandra Mazak","doi":"10.1109/COASE.2018.8560448","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560448","url":null,"abstract":"Model-based engineering is an emerging paradigm to deal with the complexity of multi-disciplinary engineering in CPPS projects. In such projects, different kinds of models are created during the lifecycle of a production system. Automa-tionML is a promising standard to provide a unifying format to represent and connect the different engineering models. Dedicated tool support has been developed for AutomationML in the last years to create and evolve models. However, when it comes to querying AutomationML models, implementation-related query languages have to be currently used. These languages have a certain complexity as they are not directly based on the concepts of AutomationML but on the underlying technological concepts and encodings of AutomationML. This often hinders the formulation of automatically executable queries by domain experts. In this paper, we propose a dedicated query language for AutomationML called Automation Query Language (Au-tomationQL) which is directly derived from AutomationML. Using this query language, queries can be defined in a by-example manner which allows engineers to formulate queries in terms of AutomationML concepts instead of switching to an implementation-oriented query language. We illustrate how AutomationQL is defined, how queries can be formulated as well as how tool support is provided to automatically evaluate the queries and represent their results. Finally, we contrast our solution with existing query languages and derive a roadmap for future research on AutomationQL.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"51 23","pages":"1394-1399"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91437095","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}
Pub Date : 2018-08-01DOI: 10.1109/COASE.2018.8560426
Christian Harle, Mike Barth, A. Fay
Simulation is already an essential part for the engineering of automation systems. Upcoming use-cases like high-value optimization or new digital services in combination with predictive functionalities need simulation as part of the operating machine or plant. Current implementations use centralized cloud-based simulation architectures or integrate simulation workstations. This paper proposes a concept in combination with a prototypic implementation for the decentralized simulation of physical systems or processes in the field. The simulation models are executed on single-board computers (SBC) that are promising to form a new part of the machines automation systems. To evaluate the concept, state-of-the-art simulation benchmarks have been executed by the authors. The results show the positive capability of SBCs for real-time simulations within the machine.
{"title":"Process simulation on single-board computers","authors":"Christian Harle, Mike Barth, A. Fay","doi":"10.1109/COASE.2018.8560426","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560426","url":null,"abstract":"Simulation is already an essential part for the engineering of automation systems. Upcoming use-cases like high-value optimization or new digital services in combination with predictive functionalities need simulation as part of the operating machine or plant. Current implementations use centralized cloud-based simulation architectures or integrate simulation workstations. This paper proposes a concept in combination with a prototypic implementation for the decentralized simulation of physical systems or processes in the field. The simulation models are executed on single-board computers (SBC) that are promising to form a new part of the machines automation systems. To evaluate the concept, state-of-the-art simulation benchmarks have been executed by the authors. The results show the positive capability of SBCs for real-time simulations within the machine.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"1 1","pages":"1548-1555"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88659169","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}
Pub Date : 2018-08-01DOI: 10.1109/COASE.2018.8560443
Qidong Lai, Zizhen Zhang, Xin Jin, H. Qin
Arc-routing problems (ARPs) aim to determine the least-cost vehicle routes of a specified arc subset in a graph. The split-delivery capacitated arc-routing problem (SDCARP) generalizes conventional ARPs by allowing an arc to be serviced by more than one vehicle. Because of its great complexity, the existing approaches for solving SDCARP are scant and most of them are meta-heuristics. In this paper, we analyze the characteristics of SDCARP solution structures. Then we devise a forest-based tabu search algorithm, which involves several forest-based neighborhood operators, for seeking the optimal solution. By using our method, the search space can be significantly reduced. The computational results demonstrate that our approach outperforms previous methods and is able to improve several state-of-the-art solutions on SDCARP benchmark instances.
arc -routing problem (ARPs)的目标是确定图中指定的arc子集中成本最低的车辆路线。分送能力电弧路由问题(SDCARP)通过允许一个电弧由多个车辆服务来推广传统的ARPs。由于其非常复杂，现有的解决SDCARP的方法很少，而且大多数是元启发式方法。本文分析了SDCARP解决方案结构的特点。然后设计了一种基于森林的禁忌搜索算法，该算法涉及多个基于森林的邻域算子，以寻求最优解。通过使用我们的方法，可以显著减少搜索空间。计算结果表明，我们的方法优于以前的方法，并且能够在SDCARP基准实例上改进几种最先进的解决方案。
{"title":"Forest-based Tabu Search to the Split-delivery Capacitated Arc-routing Problem","authors":"Qidong Lai, Zizhen Zhang, Xin Jin, H. Qin","doi":"10.1109/COASE.2018.8560443","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560443","url":null,"abstract":"Arc-routing problems (ARPs) aim to determine the least-cost vehicle routes of a specified arc subset in a graph. The split-delivery capacitated arc-routing problem (SDCARP) generalizes conventional ARPs by allowing an arc to be serviced by more than one vehicle. Because of its great complexity, the existing approaches for solving SDCARP are scant and most of them are meta-heuristics. In this paper, we analyze the characteristics of SDCARP solution structures. Then we devise a forest-based tabu search algorithm, which involves several forest-based neighborhood operators, for seeking the optimal solution. By using our method, the search space can be significantly reduced. The computational results demonstrate that our approach outperforms previous methods and is able to improve several state-of-the-art solutions on SDCARP benchmark instances.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"1 1","pages":"1237-1242"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90176794","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}
Pub Date : 2018-08-01DOI: 10.1109/COASE.2018.8560438
Jiabin Zhang, Zhengtao Zhang, Fei Shen, Feng Zhang, Hu Su
In this paper, a calibration method for line scan cameras with image distortion is proposed to perform high-precision planar measurement. The intrinsic parameter model is presented according to the imaging work principle of the line scan camera. Moreover, an improved camera model is proposed via integrating the perspective transformation with the extrinsic parameter model in the consideration of image distortion resulting from the non-parallelism of motion direction and object plane. On this basis, the parameters in above model are calibrated based on nonlinear damping least square method with a planar chessboard pattern. A set of measurement experiments are conducted and the results verify the effectiveness of proposed approaches.
{"title":"A New Calibration Method of Line Scan Camera for High-Precision Two-Dimensional Measurement","authors":"Jiabin Zhang, Zhengtao Zhang, Fei Shen, Feng Zhang, Hu Su","doi":"10.1109/COASE.2018.8560438","DOIUrl":"https://doi.org/10.1109/COASE.2018.8560438","url":null,"abstract":"In this paper, a calibration method for line scan cameras with image distortion is proposed to perform high-precision planar measurement. The intrinsic parameter model is presented according to the imaging work principle of the line scan camera. Moreover, an improved camera model is proposed via integrating the perspective transformation with the extrinsic parameter model in the consideration of image distortion resulting from the non-parallelism of motion direction and object plane. On this basis, the parameters in above model are calibrated based on nonlinear damping least square method with a planar chessboard pattern. A set of measurement experiments are conducted and the results verify the effectiveness of proposed approaches.","PeriodicalId":6518,"journal":{"name":"2018 IEEE 14th International Conference on Automation Science and Engineering (CASE)","volume":"86 1","pages":"678-683"},"PeriodicalIF":0.0,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"82726435","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：