Pub Date : 2005-03-19DOI: 10.1109/ICNSC.2005.1461162
Lun Ta, Y. Chai, Yi Liu
As the structure of multi-agent systems (MAS) inherently meets the requirements of autonomy and decentralization for supply chains, there are many researchers engaged in application of the MAS architecture to assist to simulating and modeling supply chain dynamics, as well as solving some local decision problems, e.g. transportation planning, production scheduling, and etc.. However, our studies are focused on developing a MAS for supply chain management in the operational level, which integrates planning, execution and supervising. In our framework, intra-organizational task allocation and interorganizational task re-allocation are critical to effective coordination and scheduling in the supply chain. And we introduce a sealed combinatorial auction mechanism to solve this problem. In order to facilitate the mechanism, the components of different agents and the negotiation protocol supporting interactions between them are presented, and some related topics are also discussed in this paper.
{"title":"A multi-agent approach for task allocation and execution for supply chain management","authors":"Lun Ta, Y. Chai, Yi Liu","doi":"10.1109/ICNSC.2005.1461162","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461162","url":null,"abstract":"As the structure of multi-agent systems (MAS) inherently meets the requirements of autonomy and decentralization for supply chains, there are many researchers engaged in application of the MAS architecture to assist to simulating and modeling supply chain dynamics, as well as solving some local decision problems, e.g. transportation planning, production scheduling, and etc.. However, our studies are focused on developing a MAS for supply chain management in the operational level, which integrates planning, execution and supervising. In our framework, intra-organizational task allocation and interorganizational task re-allocation are critical to effective coordination and scheduling in the supply chain. And we introduce a sealed combinatorial auction mechanism to solve this problem. In order to facilitate the mechanism, the components of different agents and the negotiation protocol supporting interactions between them are presented, and some related topics are also discussed in this paper.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130035571","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461178
Yu Lei, Xiaolin Zheng, Zhongding Jiang, D. Chen
In this paper, we present an adaptive panoramic video streaming scheme for distributed image based rendering (IBR) systems. Real-time rendering of complex 3D scene on mobile devices is a challenging task. The main reason is that mobile devices have limited computational capabilities and are lack of powerful 3D graphics hardware support. In such systems, server should take most of the computing job and than transmit the required image segments to client. So the efficient network transmission is vital for client to smoothly synthesize attractive 3D scenes. The proposed streaming scheme fulfils this task by probing the mobile network's status and then effective adjust the sending data to avoid network congestion and jitter. Pre-fetching and cache management are also considered for efficient memory usage and reducing transmission requests. With the help of this scheme, we implemented an interactive distributed 3D walk through system on both mobile devices and desktop computers. Experimental results show that the adaptive panoramic video streaming scheme is useful for the distributed IBR systems.
{"title":"Adaptive streaming panoramic video for image based rendering system","authors":"Yu Lei, Xiaolin Zheng, Zhongding Jiang, D. Chen","doi":"10.1109/ICNSC.2005.1461178","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461178","url":null,"abstract":"In this paper, we present an adaptive panoramic video streaming scheme for distributed image based rendering (IBR) systems. Real-time rendering of complex 3D scene on mobile devices is a challenging task. The main reason is that mobile devices have limited computational capabilities and are lack of powerful 3D graphics hardware support. In such systems, server should take most of the computing job and than transmit the required image segments to client. So the efficient network transmission is vital for client to smoothly synthesize attractive 3D scenes. The proposed streaming scheme fulfils this task by probing the mobile network's status and then effective adjust the sending data to avoid network congestion and jitter. Pre-fetching and cache management are also considered for efficient memory usage and reducing transmission requests. With the help of this scheme, we implemented an interactive distributed 3D walk through system on both mobile devices and desktop computers. Experimental results show that the adaptive panoramic video streaming scheme is useful for the distributed IBR systems.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129578517","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461281
A. Aggarwal, R. Kunal
The paper presents a novel approach for pre-processing of binary images, which helps in subsequent application of the genetic algorithm in a parallel manner and reduces the computational time, while at the same time improves the quality of the regenerated image and makes the evolutionary approach more practical to employ for fractal image compression. Pre-processing involves division of image into disconnected regions, identification of the largest solid rectangle and final partitioning about the rectangle. The performance of the proposed partitioned technique is tested on a binary image and the experimental results are reported.
{"title":"Partitioned fractal image compression for binary images using genetic algorithms","authors":"A. Aggarwal, R. Kunal","doi":"10.1109/ICNSC.2005.1461281","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461281","url":null,"abstract":"The paper presents a novel approach for pre-processing of binary images, which helps in subsequent application of the genetic algorithm in a parallel manner and reduces the computational time, while at the same time improves the quality of the regenerated image and makes the evolutionary approach more practical to employ for fractal image compression. Pre-processing involves division of image into disconnected regions, identification of the largest solid rectangle and final partitioning about the rectangle. The performance of the proposed partitioned technique is tested on a binary image and the experimental results are reported.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"03 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129787626","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461306
D. Grundel
We consider the problem of constrained path planning for one or two agents in search of a single randomly moving target such that we maximize the probability of intercepting the target at some time in its trajectory. We assume the agents operate in a receding-horizon optimization framework with some finite planning horizon. We present and compare several search path planning methods. This problem is particularly applicable in the case of wide area search munitions searching and engaging moving ground targets.
{"title":"Searching for a moving target: optimal path planning","authors":"D. Grundel","doi":"10.1109/ICNSC.2005.1461306","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461306","url":null,"abstract":"We consider the problem of constrained path planning for one or two agents in search of a single randomly moving target such that we maximize the probability of intercepting the target at some time in its trajectory. We assume the agents operate in a receding-horizon optimization framework with some finite planning horizon. We present and compare several search path planning methods. This problem is particularly applicable in the case of wide area search munitions searching and engaging moving ground targets.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124359857","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461325
Yi-Hung Liu
This study aims to investigate the scheduling performance for the flexible manufacturing system (FMS) based on two advanced attribute extraction methods. One is the kernel principal component analysis (KPCA) and the other is the generalized discriminant analysis (GDA). By using nonlinear mapping functions, both methods first map the attributes from the input space into higher dimensional feature space where the PCA and linear discriminant analysis (LDA) are performed to find the eigenvectors associated with the largest eigenvalues and the optimal transform matrix, respectively. The nonlinear mapping operation is done by using the kernel function which performs the inner dot product of input vectors in the input space. With such a manner, the input attributes are transformed into reduced dimensional features that have powerful discriminabilities in classifying various dispatching rules. Also, the task of the attribute selection is automatically done. Experimental results indicate that the KPCA and GDA are able to achieve better scheduling performance for a FIMS under several predefined conditions such as different part ratios and part routes.
{"title":"Study on the kernel-based FMS scheduling","authors":"Yi-Hung Liu","doi":"10.1109/ICNSC.2005.1461325","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461325","url":null,"abstract":"This study aims to investigate the scheduling performance for the flexible manufacturing system (FMS) based on two advanced attribute extraction methods. One is the kernel principal component analysis (KPCA) and the other is the generalized discriminant analysis (GDA). By using nonlinear mapping functions, both methods first map the attributes from the input space into higher dimensional feature space where the PCA and linear discriminant analysis (LDA) are performed to find the eigenvectors associated with the largest eigenvalues and the optimal transform matrix, respectively. The nonlinear mapping operation is done by using the kernel function which performs the inner dot product of input vectors in the input space. With such a manner, the input attributes are transformed into reduced dimensional features that have powerful discriminabilities in classifying various dispatching rules. Also, the task of the attribute selection is automatically done. Experimental results indicate that the KPCA and GDA are able to achieve better scheduling performance for a FIMS under several predefined conditions such as different part ratios and part routes.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"196 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127526563","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461208
Shao-zhong Cao, Guo-wei Yang, Xu-Yan Tu
In order to improve the intelligent level of computer aided conceptual design system, and the creative design is supported effectively, man-computer harmonization principle in harmonics is used in product conceptual design. According to the rule of "man-computer function reasonable assignment, man-computer intelligence integration, man-computer friendly communication", the structure of computer aided conceptual design system based on harmonics is given, and a modeling method of computer aided conceptual design process based on harmonics is discussed. In this paper, a original system on china product conceptual design that is developed by means of the method is introduced.
{"title":"Computer aided conceptual design based on harmonics","authors":"Shao-zhong Cao, Guo-wei Yang, Xu-Yan Tu","doi":"10.1109/ICNSC.2005.1461208","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461208","url":null,"abstract":"In order to improve the intelligent level of computer aided conceptual design system, and the creative design is supported effectively, man-computer harmonization principle in harmonics is used in product conceptual design. According to the rule of \"man-computer function reasonable assignment, man-computer intelligence integration, man-computer friendly communication\", the structure of computer aided conceptual design system based on harmonics is given, and a modeling method of computer aided conceptual design process based on harmonics is discussed. In this paper, a original system on china product conceptual design that is developed by means of the method is introduced.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114907902","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461338
Yuan Cai-xia, Wang Jing-hua, Liu Jian-yi, Wang Cong
Many existing man-machine dialog systems are designed for a specific application and users access the service mostly by telephone. This paper proposes the concept of the Web-based intelligent spoken dialog system independent of the domain. Finally, its feasibility and realization are analyzed based on a practical system.
{"title":"The Web-based domain independent DM for intelligent spoken dialog system","authors":"Yuan Cai-xia, Wang Jing-hua, Liu Jian-yi, Wang Cong","doi":"10.1109/ICNSC.2005.1461338","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461338","url":null,"abstract":"Many existing man-machine dialog systems are designed for a specific application and users access the service mostly by telephone. This paper proposes the concept of the Web-based intelligent spoken dialog system independent of the domain. Finally, its feasibility and realization are analyzed based on a practical system.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123968538","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461311
Shangming Wei, M. Žefran
In this article a new complete sensor based path planning algorithm for autonomous mobile robot is presented. The algorithm guarantees global convergence to the target while at the same time the generated path is smooth, a key requirement for implementation on real robots. The completeness of the proposed scheme is proved using techniques from hybrid control.
{"title":"Smooth path planning and control for mobile robots","authors":"Shangming Wei, M. Žefran","doi":"10.1109/ICNSC.2005.1461311","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461311","url":null,"abstract":"In this article a new complete sensor based path planning algorithm for autonomous mobile robot is presented. The algorithm guarantees global convergence to the target while at the same time the generated path is smooth, a key requirement for implementation on real robots. The completeness of the proposed scheme is proved using techniques from hybrid control.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116961507","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461225
D. Joksimovic, M. Bliemer, P. Bovy, Z. Verwater-Lukszo
In transport networks, travelers individually make route and departure time choice decisions that may not be optimal for the whole network. By introducing (time-dependent) tolls the network performance may be optimized. In the paper, the effects of time-dependent tolls on the network performance are analyzed using a dynamic traffic model. The network design problem is formulated as a bi-level optimization problem in which the upper level describes the network performance with chosen toll levels while the lower level describes the dynamic network model including user-specific route and departure time choice and the dynamic network loading. In case studies on a simple hypothetical network it is shown that network improvements can be obtained by introducing tolls. It is also shown that finding a global solution to the network design problem is complex as it is non-linear and non-convex.
{"title":"Dynamic road pricing for optimizing network performance with heterogeneous users","authors":"D. Joksimovic, M. Bliemer, P. Bovy, Z. Verwater-Lukszo","doi":"10.1109/ICNSC.2005.1461225","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461225","url":null,"abstract":"In transport networks, travelers individually make route and departure time choice decisions that may not be optimal for the whole network. By introducing (time-dependent) tolls the network performance may be optimized. In the paper, the effects of time-dependent tolls on the network performance are analyzed using a dynamic traffic model. The network design problem is formulated as a bi-level optimization problem in which the upper level describes the network performance with chosen toll levels while the lower level describes the dynamic network model including user-specific route and departure time choice and the dynamic network loading. In case studies on a simple hypothetical network it is shown that network improvements can be obtained by introducing tolls. It is also shown that finding a global solution to the network design problem is complex as it is non-linear and non-convex.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117164192","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 : 2005-03-19DOI: 10.1109/ICNSC.2005.1461243
M. Krivokon, P. Will, Wei-Min Shen
Self-reconfigurable robots are valued for adaptive and fault-tolerant operation in unpredictable environments on wide range of tasks. Self-reconfiguration is the key ability in accomplishing such tasks with the same set of hardware. Distributed control of self-reconfiguration provides tolerance to failures of individual modules and ability to cope with changing environment conditions. This paper proposes distributed control architecture capable of producing locomotion and self-reconfiguration behaviors. We provide an example of using this control method to accomplish a 'snake to dragon' configuration change in simulation. To the best of our knowledge the problem of distributed self-reconfiguration for chain-based modular robots has not been addressed before.
{"title":"Hormone-inspired distributed control of self-reconfiguration","authors":"M. Krivokon, P. Will, Wei-Min Shen","doi":"10.1109/ICNSC.2005.1461243","DOIUrl":"https://doi.org/10.1109/ICNSC.2005.1461243","url":null,"abstract":"Self-reconfigurable robots are valued for adaptive and fault-tolerant operation in unpredictable environments on wide range of tasks. Self-reconfiguration is the key ability in accomplishing such tasks with the same set of hardware. Distributed control of self-reconfiguration provides tolerance to failures of individual modules and ability to cope with changing environment conditions. This paper proposes distributed control architecture capable of producing locomotion and self-reconfiguration behaviors. We provide an example of using this control method to accomplish a 'snake to dragon' configuration change in simulation. To the best of our knowledge the problem of distributed self-reconfiguration for chain-based modular robots has not been addressed before.","PeriodicalId":313251,"journal":{"name":"Proceedings. 2005 IEEE Networking, Sensing and Control, 2005.","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2005-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123055989","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
扫码关注我们
求助内容：
应助结果提醒方式：