Pub Date : 1900-01-01DOI: 10.3233/978-1-61499-589-0-167
Pruthuvi Maheshakya Wijewardena, Thimal Kempitiya, T. Rathnayake, Kevin Rathnasekara, Thushan Ganegedara, A. Perera, D. Alahakoon
{"title":"Heterogeneous data fusion with multiple kernel growing self organizing maps","authors":"Pruthuvi Maheshakya Wijewardena, Thimal Kempitiya, T. Rathnayake, Kevin Rathnasekara, Thushan Ganegedara, A. Perera, D. Alahakoon","doi":"10.3233/978-1-61499-589-0-167","DOIUrl":"https://doi.org/10.3233/978-1-61499-589-0-167","url":null,"abstract":"","PeriodicalId":322432,"journal":{"name":"Scandinavian Conference on AI","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114421816","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 : 1900-01-01DOI: 10.3233/978-1-61499-589-0-179
J. David, Roland Philippsen
We consider the problem of finding collision-free trajectories for a fleet of automated guided vehicles (AGVs) working in ship ports and freight terminals. Our solution computes collision-free traj ...
{"title":"Task Assignment and Trajectory Planning in Dynamic environments for Multiple Vehicles","authors":"J. David, Roland Philippsen","doi":"10.3233/978-1-61499-589-0-179","DOIUrl":"https://doi.org/10.3233/978-1-61499-589-0-179","url":null,"abstract":"We consider the problem of finding collision-free trajectories for a fleet of automated guided vehicles (AGVs) working in ship ports and freight terminals. Our solution computes collision-free traj ...","PeriodicalId":322432,"journal":{"name":"Scandinavian Conference on AI","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116316222","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 : 1900-01-01DOI: 10.3233/978-1-61499-589-0-128
Sharmin Sultana Sheuly, Sudhangathan Bankarusamy, S. Begum, M. Behnam
Cloud computing has recently drawn much attention due to the benefits that it can provide in terms of high performance and parallel computing. However, many industrial applications require certain quality of services that need efficient resource management of the cloud infrastructure to be suitable for industrial applications. In this paper, we focus mainly on the services, usually executed within virtual machines, allocation problem in the cloud network. To meet the quality of service requirements we investigate different algorithms that can achieve load balancing which may require migrating virtual machines from one node/server to another during runtime and considering both CPU and communication resources. Three different allocation algorithms based on Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Best-fit heuristic algorithm are applied in this paper. We evaluate the three algorithms in terms of cost/objective function and calculation time. In addition, we explore how tuning different parameters (including population size, probability of mutation and probability of crossover) can affect the cost/objective function in GA. Depending on the evaluation, it is concluded that algorithm performance is dependent on the circumstances i.e. available resource, number of VMs etc.
{"title":"Resource Allocation in Industrial Cloud Computing Using Artificial Intelligence Algorithms","authors":"Sharmin Sultana Sheuly, Sudhangathan Bankarusamy, S. Begum, M. Behnam","doi":"10.3233/978-1-61499-589-0-128","DOIUrl":"https://doi.org/10.3233/978-1-61499-589-0-128","url":null,"abstract":"Cloud computing has recently drawn much attention due to the benefits that it can provide in terms of high performance and parallel computing. However, many industrial applications require certain quality of services that need efficient resource management of the cloud infrastructure to be suitable for industrial applications. In this paper, we focus mainly on the services, usually executed within virtual machines, allocation problem in the cloud network. To meet the quality of service requirements we investigate different algorithms that can achieve load balancing which may require migrating virtual machines from one node/server to another during runtime and considering both CPU and communication resources. Three different allocation algorithms based on Genetic Algorithm (GA), Particle Swarm Optimization (PSO) and Best-fit heuristic algorithm are applied in this paper. We evaluate the three algorithms in terms of cost/objective function and calculation time. In addition, we explore how tuning different parameters (including population size, probability of mutation and probability of crossover) can affect the cost/objective function in GA. Depending on the evaluation, it is concluded that algorithm performance is dependent on the circumstances i.e. available resource, number of VMs etc.","PeriodicalId":322432,"journal":{"name":"Scandinavian Conference on AI","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131401132","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 : 1900-01-01DOI: 10.3233/978-1-60750-754-3-3
M. Wooldridge
{"title":"Playing Games with Games","authors":"M. Wooldridge","doi":"10.3233/978-1-60750-754-3-3","DOIUrl":"https://doi.org/10.3233/978-1-60750-754-3-3","url":null,"abstract":"","PeriodicalId":322432,"journal":{"name":"Scandinavian Conference on AI","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131155130","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 : 1900-01-01DOI: 10.3233/978-1-61499-330-8-145
S. K. Jensen, Christoffer Moesgaard, Christoffer Samuel Nielsen, Sine Lyhne Viesmose
. Human gesture recognition is an area, which has been studied thoroughly in recent years, and close to 100% recognition rates in restricted environments have been achieved, often either with single separated gestures in the input stream, or with computationally intensive systems. The results are unfortunately not as strik- ing, when it comes to a continuous stream of gestures. In this paper we introduce a hierarchical system for gesture recognition for use in a gaming setting, with a continuous stream of data. Layer 1 is based on Nearest Neighbor Search and layer 2 uses Hidden Markov Models. The system uses features that are computed from Microsoft Kinect skeletons. We propose a new set of features, the relative angles of the limbs from Kinect’s axes to use in NNS. The new features show a 10 percent point increase in precision when compared with features from previously published results. We also propose a way of attributing recognised gestures with a force at- tribute, for use in gaming. The recognition rate in layer 1 is 68.2%, with an even higher rate for simple gestures. Layer 2 reduces the noise and has a average recog- nition rate of 85.1%. When some simple constraints are added we reach a precision of 90.5% with a recall of 91.4%.
{"title":"A Hierarchical Model for Continuous Gesture Recognition Using Kinect","authors":"S. K. Jensen, Christoffer Moesgaard, Christoffer Samuel Nielsen, Sine Lyhne Viesmose","doi":"10.3233/978-1-61499-330-8-145","DOIUrl":"https://doi.org/10.3233/978-1-61499-330-8-145","url":null,"abstract":". Human gesture recognition is an area, which has been studied thoroughly in recent years, and close to 100% recognition rates in restricted environments have been achieved, often either with single separated gestures in the input stream, or with computationally intensive systems. The results are unfortunately not as strik- ing, when it comes to a continuous stream of gestures. In this paper we introduce a hierarchical system for gesture recognition for use in a gaming setting, with a continuous stream of data. Layer 1 is based on Nearest Neighbor Search and layer 2 uses Hidden Markov Models. The system uses features that are computed from Microsoft Kinect skeletons. We propose a new set of features, the relative angles of the limbs from Kinect’s axes to use in NNS. The new features show a 10 percent point increase in precision when compared with features from previously published results. We also propose a way of attributing recognised gestures with a force at- tribute, for use in gaming. The recognition rate in layer 1 is 68.2%, with an even higher rate for simple gestures. Layer 2 reduces the noise and has a average recog- nition rate of 85.1%. When some simple constraints are added we reach a precision of 90.5% with a recall of 91.4%.","PeriodicalId":322432,"journal":{"name":"Scandinavian Conference on AI","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133751035","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 : 1900-01-01DOI: 10.3233/978-1-60750-754-3-90
Pavel Surynek
The task of enforcing certain level of consistency in Boolean satisfiability problem (SAT problem) is addressed in this paper. The concept of path-consistency known from the constraint programming paradigm is revisited in this context. Augmentations how to make path-consistency more suitable for SAT are specifically studied. A stronger variant of path-consistency is described and its theoretical properties are investigated. It combines the standard path consistency on the literal encoding of the given SAT instance with global properties calculated from constraints imposed by the instance – namely with the maximum number of visits of a certain set by the path. Unfortunately, the problem of enforcing this variant of path-consistency turned out to be NP hard. Hence, various types of relaxations of this stronger version of path-consistency were proposed. The relaxed version of the proposed consistency represents a trade-off between the inference strength and the complexity of its propagation algorithm. A presented theoretical analysis shows that computational costs of the proposed consistency are kept reasonably low. Performed experiments show that the new consistency outperforms the standard path-consistency in terms of the inference strength as well.
{"title":"Exploiting Global Properties in Path-Consistency Applied on SAT","authors":"Pavel Surynek","doi":"10.3233/978-1-60750-754-3-90","DOIUrl":"https://doi.org/10.3233/978-1-60750-754-3-90","url":null,"abstract":"The task of enforcing certain level of consistency in Boolean satisfiability problem (SAT problem) is addressed in this paper. The concept of path-consistency known from the constraint programming paradigm is revisited in this context. Augmentations how to make path-consistency more suitable for SAT are specifically studied. A stronger variant of path-consistency is described and its theoretical properties are investigated. It combines the standard path consistency on the literal encoding of the given SAT instance with global properties calculated from constraints imposed by the instance – namely with the maximum number of visits of a certain set by the path. Unfortunately, the problem of enforcing this variant of path-consistency turned out to be NP hard. Hence, various types of relaxations of this stronger version of path-consistency were proposed. The relaxed version of the proposed consistency represents a trade-off between the inference strength and the complexity of its propagation algorithm. A presented theoretical analysis shows that computational costs of the proposed consistency are kept reasonably low. Performed experiments show that the new consistency outperforms the standard path-consistency in terms of the inference strength as well.","PeriodicalId":322432,"journal":{"name":"Scandinavian Conference on AI","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124412437","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 : 1900-01-01DOI: 10.3233/978-1-60750-754-3-4
A. Ram
{"title":"User-Generated AI for Interactive Digital Entertainment","authors":"A. Ram","doi":"10.3233/978-1-60750-754-3-4","DOIUrl":"https://doi.org/10.3233/978-1-60750-754-3-4","url":null,"abstract":"","PeriodicalId":322432,"journal":{"name":"Scandinavian Conference on AI","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124506086","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
扫码关注我们
求助内容：
应助结果提醒方式：