Digitala Vetenskapliga Arkivet

Ändra sökning
Avgränsa sökresultatet
1234567 1 - 50 av 372
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Träffar per sida
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
  • Standard (Relevans)
  • Författare A-Ö
  • Författare Ö-A
  • Titel A-Ö
  • Titel Ö-A
  • Publikationstyp A-Ö
  • Publikationstyp Ö-A
  • Äldst först
  • Nyast först
  • Skapad (Äldst först)
  • Skapad (Nyast först)
  • Senast uppdaterad (Äldst först)
  • Senast uppdaterad (Nyast först)
  • Disputationsdatum (tidigaste först)
  • Disputationsdatum (senaste först)
Markera
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Akin, H. Levent
    et al.
    Bogazici University, Turkey.
    Ito, Nobuhiro
    Aichi Institute of Technology, Japan.
    Jacoff, Adam
    National Institute of Standards, USA.
    Kleiner, Alexander
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Pellenz, Johannes
    V&R Vision & Robotics GmbH, Germany.
    Visser, Arnoud
    University of Amsterdam, Holland.
    RoboCup Rescue Robot and Simulation Leagues2013Ingår i: The AI Magazine, ISSN 0738-4602, Vol. 34, nr 1Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    The RoboCup Rescue Robot and Simulation competitions have been held since 2000. The experience gained during these competitions has increased the maturity level of the field, which allowed deploying robots after real disasters (e.g. Fukushima Daiichi nuclear disaster). This article provides an overview of these competitions and highlights the state of the art and the lessons learned.

    Ladda ner fulltext (pdf)
    fulltext
  • 2.
    Andersson, Nisa
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem.
    Developing High level Behaviours for the Boston Dynamics Spot Using Automated Planning2023Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Over the years, the Artificial Intelligence and Integrated Computer Systems (AIICS) Division at Linköping University has developed a high-level architecture for collaborative robotic systems that includes a delegation system capable of defining complex missions to be executed by a team of agents. This architecture has been used as a part of a research arena for developing and improving public safety and security using ground, aerial, surfaceand underwater robotic systems. Recently, the division decided to purchase a Boston Dynamics Spot robot to further progress into the public safety and security research area.The robot has a robotic arm and navigation functionalities such as map building, motion planning, and obstacle avoidance. This thesis investigates how the Boston Dynamics Spot robot can be integrated into the high-level architecture for collaborative robotic systems from the AIICS division. Additionally, how the robot’s functionalities can be extended so that it is capable of determining which actions it should take to achieve high-level behavioursconsidering its capabilities and current state. In this context, higher-level behaviours include picking up and delivering first aid supplies, which can be beneficial in specific emergency situations. The study was divided and done in an iterative approach.The system was tested in various scenarios that represent its intended future use. The result demonstrated the robot’s ability to plan and accomplish the desired high-level behaviours. However, there were instances when achieving the desired behaviours proved challenging due to various limiting factors, including limitations posed by the robot’s internal controller.

    Ladda ner fulltext (pdf)
    fulltext
  • 3.
    Andersson, Olov
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Learning to Make Safe Real-Time Decisions Under Uncertainty for Autonomous Robots2020Doktorsavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Robots are increasingly expected to go beyond controlled environments in laboratories and factories, to act autonomously in real-world workplaces and public spaces. Autonomous robots navigating the real world have to contend with a great deal of uncertainty, which poses additional challenges. Uncertainty in the real world accrues from several sources. Some of it may originate from imperfect internal models of reality. Other uncertainty is inherent, a direct side effect of partial observability induced by sensor limitations and occlusions. Regardless of the source, the resulting decision problem is unfortunately computationally intractable under uncertainty. This poses a great challenge as the real world is also dynamic. It  will not pause while the robot computes a solution. Autonomous robots navigating among people, for example in traffic, need to be able to make split-second decisions. Uncertainty is therefore often neglected in practice, with potentially catastrophic consequences when something unexpected happens. The aim of this thesis is to leverage recent advances in machine learning to compute safe real-time approximations to decision-making under uncertainty for real-world robots. We explore a range of methods, from probabilistic to deep learning, as well as different combinations with optimization-based methods from robotics, planning and control. Driven by applications in robot navigation, and grounded in experiments with real autonomous quadcopters, we address several parts of this problem. From reducing uncertainty by learning better models, to directly approximating the decision problem itself, all the while attempting to satisfy both the safety and real-time requirements of real-world autonomy.

    Ladda ner fulltext (pdf)
    fulltext
    Ladda ner (jpg)
    presentationsbild
  • 4.
    Andersson, Olov
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Methods for Scalable and Safe Robot Learning2017Licentiatavhandling, sammanläggning (Övrigt vetenskapligt)
    Abstract [en]

    Robots are increasingly expected to go beyond controlled environments in laboratories and factories, to enter real-world public spaces and homes. However, robot behavior is still usually engineered for narrowly defined scenarios. To manually encode robot behavior that works within complex real world environments, such as busy work places or cluttered homes, can be a daunting task. In addition, such robots may require a high degree of autonomy to be practical, which imposes stringent requirements on safety and robustness. \setlength{\parindent}{2em}\setlength{\parskip}{0em}The aim of this thesis is to examine methods for automatically learning safe robot behavior, lowering the costs of synthesizing behavior for complex real-world situations. To avoid task-specific assumptions, we approach this from a data-driven machine learning perspective. The strength of machine learning is its generality, given sufficient data it can learn to approximate any task. However, being embodied agents in the real-world, robots pose a number of difficulties for machine learning. These include real-time requirements with limited computational resources, the cost and effort of operating and collecting data with real robots, as well as safety issues for both the robot and human bystanders.While machine learning is general by nature, overcoming the difficulties with real-world robots outlined above remains a challenge. In this thesis we look for a middle ground on robot learning, leveraging the strengths of both data-driven machine learning, as well as engineering techniques from robotics and control. This includes combing data-driven world models with fast techniques for planning motions under safety constraints, using machine learning to generalize such techniques to problems with high uncertainty, as well as using machine learning to find computationally efficient approximations for use on small embedded systems.We demonstrate such behavior synthesis techniques with real robots, solving a class of difficult dynamic collision avoidance problems under uncertainty, such as induced by the presence of humans without prior coordination. Initially using online planning offloaded to a desktop CPU, and ultimately as a deep neural network policy embedded on board a 7 quadcopter.

    Ladda ner fulltext (pdf)
    fulltext
    Ladda ner (pdf)
    omslag
    Ladda ner (jpg)
    presentationsbild
  • 5.
    Andersson, Olov
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Deep RL for Autonomous Robots: Limitations and Safety Challenges2019Konferensbidrag (Refereegranskat)
    Abstract [en]

    With the rise of deep reinforcement learning, there has also been a string of successes on continuous control problems using physics simulators. This has lead to some optimism regarding use in autonomous robots and vehicles. However, to successful apply such techniques to the real world requires a firm grasp of their limitations. As recent work has raised questions of how diverse these simulation benchmarks really are, we here instead analyze a popular deep RL approach on toy examples from robot obstacle avoidance. We find that these converge very slowly, if at all, to safe policies. We identify convergence issues on stochastic environments and local minima as problems that warrant more attention for safety-critical control applications.

  • 6.
    Andersson, Olov
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Lager, Mårten
    Saab Kockums, Malmö, Sweden.
    Lindh, Jens-Olof
    Saab Kockums, Malmö, Sweden.
    Persson, Linnea
    Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden.
    Topp, Elin A.
    Department of Computer Science, Lund University, Lund, Sweden.
    Tordenlid, Jesper
    Saab Combitech AB, Linköping, Sweden.
    Wahlberg, Bo
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Division of Decision and Control Systems, School of Electrical Engineering and Computer Science, KTH Royal Institute of Technology, Stockholm, Sweden.
    WARA-PS: a research arena for public safety demonstrations and autonomous collaborative rescue robotics experimentation2021Ingår i: Autonomous Intelligent Systems, E-ISSN 2730-616X, Vol. 1, nr 1, artikel-id 9Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    A research arena (WARA-PS) for sensing, data fusion, user interaction, planning and control of collaborative autonomous aerial and surface vehicles in public safety applications is presented. The objective is to demonstrate scientific discoveries and to generate new directions for future research on autonomous systems for societal challenges. The enabler is a computational infrastructure with a core system architecture for industrial and academic collaboration. This includes a control and command system together with a framework for planning and executing tasks for unmanned surface vehicles and aerial vehicles. The motivating application for the demonstration is marine search and rescue operations. A state-of-art delegation framework for the mission planning together with three specific applications is also presented. The first one concerns model predictive control for cooperative rendezvous of autonomous unmanned aerial and surface vehicles. The second project is about learning to make safe real-time decisions under uncertainty for autonomous vehicles, and the third one is on robust terrain-aided navigation through sensor fusion and virtual reality tele-operation to support a GPS-free positioning system in marine environments. The research results have been experimentally evaluated and demonstrated to industry and public sector audiences at a marine test facility. It would be most difficult to do experiments on this large scale without the WARA-PS research arena. Furthermore, these demonstrator activities have resulted in effective research dissemination with high public visibility, business impact and new research collaborations between academia and industry.

    Ladda ner fulltext (pdf)
    fulltext
  • 7.
    Andersson, Olov
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Heintz, Fredrik
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Model-Based Reinforcement Learning in Continuous Environments Using Real-Time Constrained Optimization2015Ingår i: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence (AAAI) / [ed] Blai Bonet and Sven Koenig, AAAI Press, 2015, s. 2497-2503Konferensbidrag (Refereegranskat)
    Abstract [en]

    Reinforcement learning for robot control tasks in continuous environments is a challenging problem due to the dimensionality of the state and action spaces, time and resource costs for learning with a real robot as well as constraints imposed for its safe operation. In this paper we propose a model-based reinforcement learning approach for continuous environments with constraints. The approach combines model-based reinforcement learning with recent advances in approximate optimal control. This results in a bounded-rationality agent that makes decisions in real-time by efficiently solving a sequence of constrained optimization problems on learned sparse Gaussian process models. Such a combination has several advantages. No high-dimensional policy needs to be computed or stored while the learning problem often reduces to a set of lower-dimensional models of the dynamics. In addition, hard constraints can easily be included and objectives can also be changed in real-time to allow for multiple or dynamic tasks. The efficacy of the approach is demonstrated on both an extended cart pole domain and a challenging quadcopter navigation task using real data.

    Ladda ner fulltext (pdf)
    AAAI-2015-Model-Based-Reinforcement
  • 8.
    Andersson, Olov
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Ljungqvist, Oskar
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Tiger, Mattias
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Axehill, Daniel
    Linköpings universitet, Institutionen för systemteknik, Reglerteknik. Linköpings universitet, Tekniska fakulteten.
    Heintz, Fredrik
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Receding-Horizon Lattice-based Motion Planning with Dynamic Obstacle Avoidance2018Ingår i: 2018 IEEE Conference on Decision and Control (CDC), Institute of Electrical and Electronics Engineers (IEEE), 2018, s. 4467-4474Konferensbidrag (Refereegranskat)
    Abstract [en]

    A key requirement of autonomous vehicles is the capability to safely navigate in their environment. However, outside of controlled environments, safe navigation is a very difficult problem. In particular, the real-world often contains both complex 3D structure, and dynamic obstacles such as people or other vehicles. Dynamic obstacles are particularly challenging, as a principled solution requires planning trajectories with regard to both vehicle dynamics, and the motion of the obstacles. Additionally, the real-time requirements imposed by obstacle motion, coupled with real-world computational limitations, make classical optimality and completeness guarantees difficult to satisfy. We present a unified optimization-based motion planning and control solution, that can navigate in the presence of both static and dynamic obstacles. By combining optimal and receding-horizon control, with temporal multi-resolution lattices, we can precompute optimal motion primitives, and allow real-time planning of physically-feasible trajectories in complex environments with dynamic obstacles. We demonstrate the framework by solving difficult indoor 3D quadcopter navigation scenarios, where it is necessary to plan in time. Including waiting on, and taking detours around, the motions of other people and quadcopters.

    Ladda ner fulltext (pdf)
    Receding-Horizon Lattice-based Motion Planning with Dynamic Obstacle Avoidance
  • 9.
    Andersson, Olov
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Sidén, Per
    Linköpings universitet, Institutionen för datavetenskap, Statistik och maskininlärning. Linköpings universitet, Filosofiska fakulteten.
    Dahlin, Johan
    Kotte Consulting AB.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Villani, Mattias
    Linköpings universitet, Institutionen för datavetenskap, Statistik och maskininlärning. Linköpings universitet, Filosofiska fakulteten. Stockholm University, Stockholm, Sweden.
    Real-Time Robotic Search using Structural Spatial Point Processes2020Ingår i: 35TH UNCERTAINTY IN ARTIFICIAL INTELLIGENCE CONFERENCE (UAI 2019), Association For Uncertainty in Artificial Intelligence (AUAI) , 2020, Vol. 115, s. 995-1005Konferensbidrag (Refereegranskat)
    Abstract [en]

    Aerial robots hold great potential for aiding Search and Rescue (SAR) efforts over large areas, such as during natural disasters. Traditional approaches typically search an area exhaustively, thereby ignoring that the density of victims varies based on predictable factors, such as the terrain, population density and the type of disaster. We present a probabilistic model to automate SAR planning, with explicit minimization of the expected time to discovery. The proposed model is a spatial point process with three interacting spatial fields for i) the point patterns of persons in the area, ii) the probability of detecting persons and iii) the probability of injury. This structure allows inclusion of informative priors from e.g. geographic or cell phone traffic data, while falling back to latent Gaussian processes when priors are missing or inaccurate. To solve this problem in real-time, we propose a combination of fast approximate inference using Integrated Nested Laplace Approximation (INLA), and a novel Monte Carlo tree search tailored to the problem. Experiments using data simulated from real world Geographic Information System (GIS) maps show that the framework outperforms competing approaches, finding many more injured in the crucial first hours.

  • 10.
    Andersson, Olov
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Wzorek, Mariusz
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Deep Learning Quadcopter Control via Risk-Aware Active Learning2017Ingår i: Proceedings of The Thirty-first AAAI Conference on Artificial Intelligence (AAAI) / [ed] Satinder Singh and Shaul Markovitch, AAAI Press, 2017, Vol. 5, s. 3812-3818Konferensbidrag (Refereegranskat)
    Abstract [en]

    Modern optimization-based approaches to control increasingly allow automatic generation of complex behavior from only a model and an objective. Recent years has seen growing interest in fast solvers to also allow real-time operation on robots, but the computational cost of such trajectory optimization remains prohibitive for many applications. In this paper we examine a novel deep neural network approximation and validate it on a safe navigation problem with a real nano-quadcopter. As the risk of costly failures is a major concern with real robots, we propose a risk-aware resampling technique. Contrary to prior work this active learning approach is easy to use with existing solvers for trajectory optimization, as well as deep learning. We demonstrate the efficacy of the approach on a difficult collision avoidance problem with non-cooperative moving obstacles. Our findings indicate that the resulting neural network approximations are least 50 times faster than the trajectory optimizer while still satisfying the safety requirements. We demonstrate the potential of the approach by implementing a synthesized deep neural network policy on the nano-quadcopter microcontroller.

  • 11.
    Andersson, Olov
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Wzorek, Mariusz
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Rudol, Piotr
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Model-Predictive Control with Stochastic Collision Avoidance using Bayesian Policy Optimization2016Ingår i: IEEE International Conference on Robotics and Automation (ICRA), 2016, Institute of Electrical and Electronics Engineers (IEEE), 2016, s. 4597-4604Konferensbidrag (Refereegranskat)
    Abstract [en]

    Robots are increasingly expected to move out of the controlled environment of research labs and into populated streets and workplaces. Collision avoidance in such cluttered and dynamic environments is of increasing importance as robots gain more autonomy. However, efficient avoidance is fundamentally difficult since computing safe trajectories may require considering both dynamics and uncertainty. While heuristics are often used in practice, we take a holistic stochastic trajectory optimization perspective that merges both collision avoidance and control. We examine dynamic obstacles moving without prior coordination, like pedestrians or vehicles. We find that common stochastic simplifications lead to poor approximations when obstacle behavior is difficult to predict. We instead compute efficient approximations by drawing upon techniques from machine learning. We propose to combine policy search with model-predictive control. This allows us to use recent fast constrained model-predictive control solvers, while gaining the stochastic properties of policy-based methods. We exploit recent advances in Bayesian optimization to efficiently solve the resulting probabilistically-constrained policy optimization problems. Finally, we present a real-time implementation of an obstacle avoiding controller for a quadcopter. We demonstrate the results in simulation as well as with real flight experiments.

  • 12.
    Ayoub, Yohan
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem.
    Multi-agent route planning for uncrewed aircraft systems operating in U-space airspace2023Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Society today brings a high pace development and demand of Artificial intelligence systems as well as robotics. To further expand and to take one step closer to have Unmanned Aerial Vehicles (UAVs) working in the cities, the European Union Aviation Safety Agency launched a project that introduces U-space airspace, an airspace where UAVs, for instance, are allowed to operate for commercial services.The problems defined for U-space airspace resemble problems defined in the area of multi-agent path finding, such as scaling and traffic etc., resulting an interest to research whether MAPF-solutions can be applied to U-space scenarios. The following thesis extends the state-of-the-art MAPF-algorithm Continuous-time Conflict based search (CCBS) to handle simplified U-space scenarios, as well as extend other A*-based algorithms, such as a version of the Receding Horizon Lattice-based Motion Planning named Extended Multi-agent A* algorithm with Wait-Time (EMAWT) and an extended A* named Extended Multi-agent A* algorithm (EMA) to handle them. Comparisons of the three algorithms resulted in the EMAWT being the most reliable and stable solution throughout all tests, whilst for fewer agents, the CCBS being the clear best solution.

    Ladda ner fulltext (pdf)
    fulltext
  • 13.
    Basirat, Ali
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten. Uppsala Univ, Sweden.
    Allassonniere-Tang, Marc
    Univ Lyon, France.
    Berdicevskis, Aleksandrs
    Univ Gothenburg, Sweden.
    An empirical study on the contribution of formal and semantic features to the grammatical gender of nouns2021Ingår i: Linguistics Vanguard, E-ISSN 2199-174X, Vol. 7, nr 1, artikel-id 20200048Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This study conducts an experimental evaluation of two hypotheses about the contributions of formal and semantic features to the grammatical gender assignment of nouns. One of the hypotheses (Corbett and Fraser 2000) claims that semantic features dominate formal ones. The other hypothesis, formulated within the optimal gender assignment theory (Rice 2006), states that form and semantics contribute equally. Both hypotheses claim that the combination of formal and semantic features yields the most accurate gender identification. In this paper, we operationalize and test these hypotheses by trying to predict grammatical gender using only character-based embeddings (that capture only formal features), only context-based embeddings (that capture only semantic features) and the combination of both. We performed the experiment using data from three languages with different gender systems (French, German and Russian). Formal features are a significantly better predictor of gender than semantic ones, and the difference in prediction accuracy is very large. Overall, formal features are also significantly better than the combination of form and semantics, but the difference is very small and the results for this comparison are not entirely consistent across languages.

  • 14.
    Behnke, Gregor
    et al.
    University of Amsterdam, Netherlands.
    Speck, David
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Katz, Michael
    IBM T.J. Watson Research Center, Yorktown Heights, USA.
    Sohrabi, Shirin
    IBM T.J. Watson Research Center, Yorktown Heights, USA.
    On Partial Satisfaction Planning with Total-Order HTNs2023Ingår i: Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023, Vol. 33, s. 42-51Konferensbidrag (Refereegranskat)
    Abstract [en]

    Since its introduction, partial satisfaction planning (PSP), including both oversubscription (OSP) and net-benefit, has received significant attention in the classical planning community. However, hierarchical aspects have been mostly ignored in this context, although several problem domains that form the main motivation for PSP, such as the rover domain, have an inherent hierarchical structure. In this paper, we are taking the necessary steps for facilitating this research direction. First, we formally define hierarchical partial satisfaction planning problems and discuss the usefulness and necessity of this formalism. Second, we present a carefully structured set of benchmarks consisting of OSP and net-benefit problems with hierarchical structure. We describe and analyze the different domains of the benchmark set and the desiderata that are met to provide an interesting and challenging starting point for upcoming research. Third, we introduce various planning techniques that can solve hierarchical OSP problems and investigate their empirical behaviour on our proposed benchmark.

  • 15.
    Bergdahl, Christopher
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerad datorsystem. Linköpings universitet, Tekniska högskolan.
    Modeling Air Combat with Influence Diagrams2013Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Air combat is a complex situation, training for it and analysis of possible tactics are time consuming and expensive. In order to circumvent those problems, mathematical models of air combat can be used. This thesis presents air combat as a one-on-one influence diagram game where the influence diagram allows the dynamics of the aircraft, the preferences of the pilots and the uncertainty of decision making in a structural and transparent way to be taken into account. To obtain the players’ game optimal control sequence with respect to their preferences, the influence diagram has to be solved. This is done by truncating the diagram with a moving horizon technique and determining and implementing the optimal controls for a dynamic game which only lasts a few time steps.

    The result is a working air combat model, where a player estimates the probability that it resides in any of four possible states. The pilot’s preferences are modeled by utility functions, one for each possible state. In each time step, the players are maximizing the cumulative sum of the utilities for each state which each possible action gives. These are weighted with the corresponding probabilities. The model is demonstrated and evaluated in a few interesting aspects. The presented model offers a way of analyzing air combat tactics and maneuvering as well as a way of making autonomous decisions in for example air combat simulators. 

    Ladda ner fulltext (pdf)
    christopher_bergdahl_thesis_fulltext
  • 16.
    Bergekrans, William
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem.
    Automatic Man Overboard Detection with an RGB Camera: Using convolutional neural networks2022Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Man overboard is one of the most common and dangerous accidents that can occur whentraveling on a boat. Available research on man overboard systems with cameras have focusedon man overboard taking place from larger ships, which involves a fall from a height.Recreational boat manufacturers often use cord-based kill switches that turns of the engineif the wearer falls overboard. The aim of this thesis is to create a man overboard warningsystem based on state-of-the-art object detection models that can detect man overboard situationthrough inputs from a camera. Awell performing warning system would allow boatmanufactures to comply with safety regulations and expand the kill-switch coverage to allpassengers on the boat. Furthermore, the aim is also to create two new datasets: one dedicatedto human detection and one with man overboard fall sequences. YOLOv5 achievedthe highest performance on a new human detection dataset, with an average precision of97%. A Mobilenet-SSD-v1 network based on weights from training on the PASCAL VOCdataset and additional training on the new man overboard dataset is used as the detectionmodel in final warning system. The man overboard warning system achieves an accuracyof 50% at best, with a precision of 58% and recall of 78%.

    Ladda ner fulltext (pdf)
    bergekrans-man-overboard-detection
  • 17.
    Berger, Cyrille
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Colour perception graph for characters segmentation2014Ingår i: Advances in Visual Computing: 10th International Symposium, ISVC 2014, Las Vegas, NV, USA, December 8-10, 2014, Proceedings / [ed] George Bebis, Richard Boyle, Bahram Parvin, Darko Koracin, Ryan McMahan, Jason Jerald, Hui Zhang, Steven M. Drucker, Chandra Kambhamettu, Maha El Choubassi, Zhigang Deng, Mark Carlson, Springer, 2014, s. 598-608Konferensbidrag (Refereegranskat)
    Abstract [en]

    Characters recognition in natural images is a challenging problem, asit involves segmenting characters of various colours on various background. Inthis article, we present a method for segmenting images that use a colour percep-tion graph. Our algorithm is inspired by graph cut segmentation techniques andit use an edge detection technique for filtering the graph before the graph-cut aswell as merging segments as a final step. We also present both qualitative andquantitative results, which show that our algorithm perform at slightly better andfaster to a state of the art algorithm.

    Ladda ner fulltext (pdf)
    fulltext
  • 18.
    Berger, Cyrille
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Strokes detection for skeletonisation of characters shapes2014Ingår i: Advances in Visual Computing: 10th International Symposium, ISVC 2014, Las Vegas, NV, USA, December 8-10, 2014, Proceedings, Part II / [ed] George Bebis, Richard Boyle, Bahram Parvin, Darko Koracin, Ryan McMahan, Jason Jerald, Hui Zhang, Steven M. Drucker, Chandra Kambhamettu, Maha El Choubassi, Zhigang Deng, Mark Carlson, Springer, 2014, s. 510-520Konferensbidrag (Refereegranskat)
    Abstract [en]

    Skeletonisation is a key process in character recognition in natural images. Under the assumption that a character is made of a stroke of uniform colour, with small variation in thickness, the process of recognising characters can be decomposed in the three steps. First the image is segmented, then each segment is transformed into a set of connected strokes (skeletonisation), which are then abstracted in a descriptor that can be used to recognise the character. The main issue with skeletonisation is the sensitivity with noise, and especially, the presence of holes in the masks. In this article, a new method for the extraction of strokes is presented, which address the problem of holes in the mask and does not use any parameters.

    Ladda ner fulltext (pdf)
    fulltext
  • 19.
    Berger, Cyrille
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerad datorsystem. Linköpings universitet, Tekniska högskolan.
    Weak Constraints Network Optimiser2012Ingår i: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), IEEE , 2012, s. 1270-1277Konferensbidrag (Refereegranskat)
    Abstract [en]

    We present a general framework to estimate the parameters of both a robot and landmarks in 3D. It relies on the use of a stochastic gradient descent method for the optimisation of the nodes in a graph of weak constraints where the landmarks and robot poses are the nodes. Then a belief propagation method combined with covariance intersection is used to estimate the uncertainties of the nodes. The first part of the article describes what is needed to define a constraint and a node models, how those models are used to update the parameters and the uncertainties of the nodes. The second part present the models used for robot poses and interest points, as well as simulation results.

  • 20.
    Berger, Cyrille
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Rudol, Piotr
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Wzorek, Mariusz
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    RGS: RDF graph synchronization for collaborative robotics2023Ingår i: Autonomous Agents and Multi-Agent Systems, ISSN 1387-2532, E-ISSN 1573-7454, Vol. 37, nr 2, artikel-id 47Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In the context of collaborative robotics, distributed situation awareness is essential for supporting collective intelligence in teams of robots and human agents where it can be used for both individual and collective decision support. This is particularly important in applications pertaining to emergency rescue and crisis management. During operational missions, data and knowledge is gathered incrementally and in different ways by heterogeneous robots and humans. The purpose of this paper is to describe an RDF Graph Synchronization System called RGS⊕. It is assumed that a dynamic set of agents provide or retrieve knowledge stored in their local RDF Graphs which are continuously synchronized between agents. The RGS⊕ System was designed to handle unreliable communication and does not rely on a static centralized infrastructure. It is capable of synchronizing knowledge as timely as possible and allows agents to access knowledge while it is incrementally acquired. A deeper empirical analysis of the RGS⊕ System is provided that shows both its efficiency and efficacy.

  • 21.
    Berger, Cyrille
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Lacroix, Simon
    LAAS, France.
    DSeg: Direct Line Segments Detection2023Rapport (Övrigt vetenskapligt)
    Abstract [en]

    This paper presents a model-driven approach to detect image line segments. The approach incrementally detects segments on the gradient image using a linear Kalman filter that estimates the supporting line parameters and their associated variances. The algorithm is fast and robust with respect to image noise and illumination variations, it allows the detection of longer line segments than data-driven approaches, and does not require any tedious parameters tuning. An extension of the algorithm that exploits a pyramidal approach to enhance the quality of results is proposed. Results with varying scene illumination and comparisons to classic existing approaches are presented.

  • 22.
    Berger, Cyrille
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Rudol, Piotr
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Wzorek, Mariusz
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Kleiner, Alexander
    iRobot, Pasadena, CA, USA.
    Evaluation of Reactive Obstacle Avoidance Algorithms for a Quadcopter2016Ingår i: Proceedings of the 14th International Conference on Control, Automation, Robotics and Vision 2016 (ICARCV), IEEE conference proceedings, 2016, artikel-id Tu31.3Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this work we are investigating reactive avoidance techniques which can be used on board of a small quadcopter and which do not require absolute localisation. We propose a local map representation which can be updated with proprioceptive sensors. The local map is centred around the robot and uses spherical coordinates to represent a point cloud. The local map is updated using a depth sensor, the Inertial Measurement Unit and a registration algorithm. We propose an extension of the Dynamic Window Approach to compute a velocity vector based on the current local map. We propose to use an OctoMap structure to compute a 2-pass A* which provide a path which is converted to a velocity vector. Both approaches are reactive as they only make use of local information. The algorithms were evaluated in a simulator which offers a realistic environment, both in terms of control and sensors. The results obtained were also validated by running the algorithms on a real platform.

  • 23.
    Berger, Cyrille
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Wzorek, Mariusz
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Kvarnström, Jonas
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Conte, Gianpaolo
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Eriksson, Alexander
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Area Coverage with Heterogeneous UAVs using Scan Patterns2016Ingår i: 2016 IEEE International Symposium on Safety, Security, and Rescue Robotics (SSRR): proceedings, IEEE Robotics and Automation Society, 2016Konferensbidrag (Refereegranskat)
    Abstract [en]

    In this paper we consider a problem of scanningan outdoor area with a team of heterogeneous Unmanned AirVehicles (UAVs) equipped with different sensors (e.g. LIDARs).Depending on the availability of the UAV platforms and themission requirements there is a need to either minimise thetotal mission time or to maximise certain properties of thescan output, such as the point cloud density. The key challengeis to divide the scanning task among UAVs while taking intoaccount the differences in capabilities between platforms andsensors. Additionally, the system should be able to ensure thatconstraints such as limit on the flight time are not violated.We present an approach that uses an optimisation techniqueto find a solution by dividing the area between platforms,generating efficient scan trajectories and selecting flight andscanning parameters, such as velocity and flight altitude. Thismethod has been extensively tested on a large set of randomlygenerated scanning missions covering a wide range of realisticscenarios as well as in real flights.

    Ladda ner fulltext (pdf)
    fulltext
  • 24.
    Berglund, Aseel
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Programvara och system. Linköpings universitet, Tekniska högskolan.
    Heintz, Fredrik
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerad datorsystem. Linköpings universitet, Tekniska högskolan.
    Integrating Soft Skills into Engineering Education for Increased Student Throughput and more Professional Engineers2014Ingår i: Proceedings of LTHs 8:e Pedagogiska Inspirationskonferens (PIK), Lund, Sweden: Lunds university , 2014Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    Soft skills are recognized as crucial for engineers as technical work is becoming more and more collaborative and interdisciplinary. Today many engineering educations fail to give appropriate training in soft skills. Linköping University has therefore developed a completely new course “Professionalism for Engineers” for two of its 5-year engineering programs in the area of computer science. The course stretches over the first 3 years with students from the three years taking it together. The purpose of the course is to give engineering students training in soft skills that are of importance during the engineering education as well as during their professional career. The examination is based on the Dialogue Seminar Method developed for learning from experience and through reflection. The organization of the course is innovative in many ways.

  • 25.
    Bergman, Oscar
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem.
    Generating fishing boats behaviour based on historic AIS data: A method to generate maritime trajectories based on historicpositional data2022Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis describes a method to generate new trajectories based on historic positiondata for a given geographical area. The thesis uses AIS-data from fishing boats to first describe a method that uses DBSCAN and OPTICS algorithms to cluster the data into clustersbased on routes where the boats travel and areas where the boats fish.Here bayesian optimization has been utilized to search for parameters for the clusteringalgorithms. In this given scenario it was shown DBSCAN is better in all fields, but it hasmany points where OPTICS has the potential to become better if it was modified a bit.This is followed by a method describing how to take the clusters and build a nodenetwork that then can be traversed using a path finding algorithm combined with internalrules to generate new routes that can be used in simulations to give a realistic enoughsituation picture. Finally a method to evaluate these generated routes are described andused to compare the routes to each other

    Ladda ner fulltext (pdf)
    fulltext
  • 26.
    Bergström, David
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem.
    Bayesian optimization for selecting training and validation data for supervised machine learning: using Gaussian processes both to learn the relationship between sets of training data and model performance, and to estimate model performance over the entire problem domain2019Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Validation and verification in machine learning is an open problem which becomes increasingly important as its applications becomes more critical. Amongst the applications are autonomous vehicles and medical diagnostics. These systems all needs to be validated before being put into use or else the consequences might be fatal.

    This master’s thesis focuses on improving both learning and validating machine learning models in cases where data can either be generated or collected based on a chosen position. This can for example be taking and labeling photos at the position or running some simulation which generates data from the chosen positions.

    The approach is twofold. The first part concerns modeling the relationship between any fixed-size set of positions and some real valued performance measure. The second part involves calculating such a performance measure by estimating the performance over a region of positions.

    The result is two different algorithms, both variations of Bayesian optimization. The first algorithm models the relationship between a set of points and some performance measure while also optimizing the function and thus finding the set of points which yields the highest performance. The second algorithm uses Bayesian optimization to approximate the integral of performance over the region of interest. The resulting algorithms are validated in two different simulated environments.

    The resulting algorithms are applicable not only to machine learning but can also be used to optimize any function which takes a set of positions and returns a value, but are more suitable when the function is expensive to evaluate.

    Ladda ner fulltext (pdf)
    david-bergstrom-masters-thesis
  • 27.
    Bergström, David
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Tiger, Mattias
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Heintz, Fredrik
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Bayesian optimization for selecting training and validation data for supervised machine learning2019Ingår i: 31st annual workshop of the Swedish Artificial Intelligence Society (SAIS 2019), Umeå, Sweden, June 18-19, 2019., 2019Konferensbidrag (Övrigt vetenskapligt)
    Abstract [en]

    Validation and verification of supervised machine learning models is becoming increasingly important as their complexity and range of applications grows. This paper describes an extension to Bayesian optimization which allows for selecting both training and validation data, in cases where data can be generated or calculated as a function of a spatial location.

  • 28.
    Bergström, Patrik
    Linköpings universitet, Institutionen för datavetenskap, Databas och informationsteknik. Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerad datorsystem. Linköpings universitet, Tekniska högskolan.
    Automated Setup of Display Protocols2015Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [sv]

    Röntgenläkares arbetsbörda har under flera årtionden ökat. Den digitala sjukvårdsteknologin utvecklas ständigt vilket bidrar till ett förbättrat arbetsflöde och kortare undersökningstider i radiologiavdelningar. Datorsystem används idag överallt inom sjukvården och används bland annat för att visa bilder åt röntgenläkare. För att underlätta visningen används display protocol som automatiskt skapar layouts och hänger bilder åt användaren. För att täcka ett stort antal olika undersökningstyper krävs att användaren skapar hundratals protokoll vilket är en tidskrävande uppgift, och systemet kan ändå misslyckas med att hänga upp bilder om de strikta kraven protokollen ställer inte uppfylls. För att ta bort detta manuella steg föreslår vi att man använder maskininlärning baserat på tidigare sparade presentationer.  Klassificerarna tränas på undersökningens metadata och radiologens preferenser på hängning av serier. Den valda metoden går ut på att skapa klassificerare för olika layout-regler och att sedan använda deras output i en algoritm som placerar ut series-typer till individuella bildplatser enligt kategorier baserade på metadata. Denna metod liknar den process de nuvarande display protokollen utför. De presentationer som skapats visar att systemet kan läras upp, men kräver högre precision om det ska användas kommersiellt. Analys av de olika delarna tyder på att ökad precision tidigt i systemet skulle öka den totala precision.

    Ladda ner fulltext (pdf)
    AutomatedSetupOfDisplayProtocols
  • 29.
    Bhatt, Mehul
    et al.
    University of Bremen, Germany.
    Erdem, Esra
    Sabanci University, Turkey.
    Heintz, Fredrik
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Spranger, Michael
    Sony Comp Science Labs Inc, Japan.
    Cognitive robotics in JOURNAL OF EXPERIMENTAL and THEORETICAL ARTIFICIAL INTELLIGENCE, vol 28, issue 5, pp 779-7802016Ingår i: Journal of experimental and theoretical artificial intelligence (Print), ISSN 0952-813X, E-ISSN 1362-3079, Vol. 28, nr 5, s. 779-780Artikel i tidskrift (Övrigt vetenskapligt)
    Abstract [en]

    n/a

  • 30.
    Bialek, Lukasz
    et al.
    Univ Warsaw, Poland.
    Dunin-Keplicz, Barbara
    Univ Warsaw, Poland.
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten. Univ Warsaw, Poland.
    A paraconsistent approach to actions in informationally complex environments2019Ingår i: Annals of Mathematics and Artificial Intelligence, ISSN 1012-2443, E-ISSN 1573-7470, Vol. 86, nr 4, s. 231-255Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Contemporary systems situated in real-world open environments frequently have to cope with incomplete and inconsistent information that typically increases complexity of reasoning and decision processes. Realistic modeling of such informationally complex environments calls for nuanced tools. In particular, incomplete and inconsistent information should neither trivialize nor stop both reasoning or planning. The paper introduces ACTLOG, a rule-based four-valued language designed to specify actions in a paraconsistent and paracomplete manner. ACTLOG is an extension of 4QL(Bel), a language for reasoning with paraconsistent belief bases. Each belief base stores multiple world representations. In this context, ACTLOGs action may be seen as a belief bases transformer. In contrast to other approaches, ACTLOG actions can be executed even when the underlying belief base contents is inconsistent and/or partial. ACTLOG provides a nuanced action specification tools, allowing for subtle interplay among various forms of nonmonotonic, paraconsistent, paracomplete and doxastic reasoning methods applicable in informationally complex environments. Despite its rich modeling possibilities, it remains tractable. ACTLOG permits for composite actions by using sequential and parallel compositions as well as conditional specifications. The framework is illustrated on a decontamination case study known from the literature.

    Ladda ner fulltext (pdf)
    fulltext
  • 31.
    Bialek, Lukasz
    et al.
    University of Warsaw, Poland.
    Dunin-Keplicz, Barbara
    University of Warsaw, Poland.
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Belief Shadowing2019Ingår i: Engineering Multi-Agent Systems. EMAS 2018 / [ed] Weyns D., Mascardi V., Ricci A., Cham: Springer, 2019, s. 158-180Konferensbidrag (Refereegranskat)
  • 32.
    Bialek, Lukasz
    et al.
    Univ Warsaw, Poland.
    Dunin-Keplicz, Barbara
    Univ Warsaw, Poland.
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten. Univ Warsaw, Poland.
    Rule-Based Reasoning with Belief Structures2017Ingår i: FOUNDATIONS OF INTELLIGENT SYSTEMS, ISMIS 2017, SPRINGER INTERNATIONAL PUBLISHING AG , 2017, Vol. 10352, s. 229-239Konferensbidrag (Refereegranskat)
    Abstract [en]

    This paper introduces 4QL(Bel), a four-valued rule language designed for reasoning with paraconsistent and paracomplete belief bases as well as belief structures. Belief bases consist of finite sets of ground literals providing (partial and possibly inconsistent) complementary or alternative views of the world. As introduced earlier, belief structures consist of constituents, epistemic profiles and consequents. Constituents and consequents are belief bases playing different roles. Agents perceive the world forming their constituents, which are further transformed into consequents via the agents or groups epistemic profile. In order to construct 4QL(Bel), we extend 4QL, a four-valued rule language permitting for many forms of reasoning, including doxastic reasoning. Despite the expressiveness of 4QL(Bel), we show that its tractability is retained.

  • 33.
    Bialek, Lukasz
    et al.
    Institute of Informatics, University of Warsaw, Poland.
    Dunin-Keplicz, Barbara
    Institute of Informatics, University of Warsaw, Poland.
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Towards a Paraconsistent Approach to Actions in Distributed Information-Rich Environments2018Ingår i: Intelligent Distributed Computing XI / [ed] Mirjana Ivanović, Costin Bădică, Jürgen Dix, Zoran Jovanović, Michele Malgeri, Miloš Savić, Cham: Springer, 2018, Vol. 737, s. 49-60Konferensbidrag (Refereegranskat)
    Abstract [en]

    The paper introduces ActLog, a rule-based language capable of specifying actions paraconsistently. ActLog is an extension of 4QL Bel " role="presentation"> Bel , a rule-based language for reasoning with paraconsistent and paracomplete belief bases and belief structures. Actions considered in the paper act on belief bases rather than states represented as sets of ground literals. Each belief base stores multiple world representations which can be though of as a representation of possible states. In this context ActLog’s action may be then seen as a method of transforming one belief base into another. In contrast to other approaches, ActLog permits to execute actions even if the underlying belief base state is partial or inconsistent. Finally, the framework introduced in this paper is tractable.

  • 34.
    Bialek, Lukasz
    et al.
    Institute of Informatics, University of Warsaw, Warsaw, Poland.
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Lightweight Reasoning with Incomplete and Inconsistent Information: a Case Study2014Ingår i: 2014 IEEE/WIC/ACM International Joint Conferences on  (Volume:3 ) Web Intelligence (WI) and Intelligent Agent Technologies (IAT),, IEEE , 2014, Vol. 3, s. 325-332Konferensbidrag (Refereegranskat)
    Abstract [en]

    Dealing with heterogeneous information sources and reasoning techniques allowing for incomplete and inconsistent information is one of current challenges in the area of knowledge representation and reasoning. We advocate for 4QL, a rule-based query language, as a proper tool allowing one to address these challenges. To justify this point of view we discuss a rescue robotics scenario for which a simulator has been developed and tested. In particular, we present a planner using 4QL and, therefore, capable to deal with lack of knowledge and inconsistencies. Through the case study we show that our approach allows one to use lightweight knowledge representation tools: due to the use of 4QL tractability of modeling and reasoning is guaranteed and high usability is achieved.

  • 35.
    Bock, Alexander
    et al.
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    Kleiner, Alexander
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Lundberg, Jonas
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    Ropinski, Timo
    Linköpings universitet, Institutionen för teknik och naturvetenskap, Medie- och Informationsteknik. Linköpings universitet, Tekniska högskolan.
    Supporting Urban Search & Rescue Mission Planning through Visualization-Based Analysis2014Ingår i: Proceedings of the Vision, Modeling, and Visualization Conference 2014, Eurographics - European Association for Computer Graphics, 2014Konferensbidrag (Refereegranskat)
    Abstract [en]

    We propose a visualization system for incident commanders in urban search~\&~rescue scenarios that supports access path planning for post-disaster structures. Utilizing point cloud data acquired from unmanned robots, we provide methods for assessment of automatically generated paths. As data uncertainty and a priori unknown information make fully automated systems impractical, we present a set of viable access paths, based on varying risk factors, in a 3D environment combined with the visual analysis tools enabling informed decisions and trade-offs. Based on these decisions, a responder is guided along the path by the incident commander, who can interactively annotate and reevaluate the acquired point cloud to react to the dynamics of the situation. We describe design considerations for our system, technical realizations, and discuss the results of an expert evaluation.

    Ladda ner fulltext (pdf)
    fulltext
  • 36.
    Bonet, Blai
    et al.
    Universitat Pompeu Fabra, Spain.
    Drexler, Dominik
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. University of Freiburg, Freiburg, Germany.
    Geffner, Hector
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    On Policy Reuse: An Expressive Language for Representing and Executing General Policies that Call Other Policies2024Ingår i: Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2024) / [ed] Sara Bernardini and Christian Muise, 2024Konferensbidrag (Refereegranskat)
    Abstract [en]

    Recently,a simple but powerful language for expressing and learning general policies and problem decompositions (sketches) has been introduced in terms of rules defined over a set of Boolean and numerical features. In this work, we consider three extensions of this language aimed at making policies and sketches more flexible and reusable: internal memory states, as in finite state controllers; indexical features, whose values are a function of the state and a number of internal registers that can be loaded with objects; and modules that wrap up policies and sketches and allow them to call each other by passing parameters. In addition, unlike general policies that select state transitions rather than ground actions, the new language allows for the selection of such actions. The expressive power of the resulting language for policies and sketches is illustrated through a number of examples.

  • 37.
    Bonte, Pieter
    et al.
    KU Leuven Campus Kulak.
    Calbimonte, Jean-Paul
    University of Applied Sciences and Arts Western Switzerland HES-SO.
    de Leng, Daniel
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Dell'Aglio, Daniele
    Aalborg University.
    Della Valle, Emanuele
    DEIB - Politecnico di Milano.
    Eiter, Thomas
    Technische Universität Wien.
    Giannini, Federico
    DEIB - Politecnico di Milano.
    Heintz, Fredrik
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Schekotihin, Konstantin
    Alpen-Adria-Universität Klagenfurt.
    Le-Phuoc, Danh
    Technical University Berlin.
    Mileo, Alessandra
    Insight Centre for Data Analytics, Dublin City University.
    Schneider, Patrik
    Technische Universität Wien.
    Tommasini, Riccardo
    INSA Lyon.
    Urbani, Jacopo
    Vrije Universiteit Amsterdam.
    Ziffer, Giacomo
    DEIB - Politecnico di Milano.
    Grounding Stream Reasoning Research2024Ingår i: Transactions on Graph Data and Knowledge (TGDK), ISSN 2942-7517, Vol. 2, nr 1, s. 1-47, artikel-id 2Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    In the last decade, there has been a growing interest in applying AI technologies to implement complex data analytics over data streams. To this end, researchers in various fields have been organising a yearly event called the "Stream Reasoning Workshop" to share perspectives, challenges, and experiences around this topic.

    In this paper, the previous organisers of the workshops and other community members provide a summary of the main research results that have been discussed during the first six editions of the event. These results can be categorised into four main research areas: The first is concerned with the technological challenges related to handling large data streams. The second area aims at adapting and extending existing semantic technologies to data streams. The third and fourth areas focus on how to implement reasoning techniques, either considering deductive or inductive techniques, to extract new and valuable knowledge from the data in the stream.

    This summary is written not only to provide a crystallisation of the field, but also to point out distinctive traits of the stream reasoning community. Moreover, it also provides a foundation for future research by enumerating a list of use cases and open challenges, to stimulate others to join this exciting research area.

  • 38.
    Borggren, Lukas
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem.
    Automatic Categorization of News Articles With Contextualized Language Models2021Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    This thesis investigates how pre-trained contextualized language models can be adapted for multi-label text classification of Swedish news articles. Various classifiers are built on pre-trained BERT and ELECTRA models, exploring global and local classifier approaches. Furthermore, the effects of domain specialization, using additional metadata features and model compression are investigated. Several hundred thousand news articles are gathered to create unlabeled and labeled datasets for pre-training and fine-tuning, respectively. The findings show that a local classifier approach is superior to a global classifier approach and that BERT outperforms ELECTRA significantly. Notably, a baseline classifier built on SVMs yields competitive performance. The effect of further in-domain pre-training varies; ELECTRA’s performance improves while BERT’s is largely unaffected. It is found that utilizing metadata features in combination with text representations improves performance. Both BERT and ELECTRA exhibit robustness to quantization and pruning, allowing model sizes to be cut in half without any performance loss.

    Ladda ner fulltext (pdf)
    fulltext
  • 39.
    Boyden, Michael
    et al.
    Radboud Univ Nijmegen, Netherlands.
    Basirat, Ali
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Berglund, Karl
    Uppsala Univ, Sweden.
    Digital Conceptual History and the Emergence of a Globalized Climate Imaginary2022Ingår i: Contributions to the History of Concepts, ISSN 1807-9326, E-ISSN 1874-656X, Vol. 17, nr 2, s. 95-122Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    This article offers an exploratory quantitative analysis of the conceptual career of climate in US English over the period 1800-2010. Our aim is to qualify two, closely related arguments circulating in Environmental Humanities scholarship regarding the concepts history, namely that we only started to think of climate as a global entity after the introduction of general circulation models during the final quarter of the twentieth century, and, second, that climatic change only became an issue of environmental concern once scientists began to approach climate as a global model. While we do not dispute that the computer revolution resulted in a significantly new understanding of climate, our analysis points to a longer process of singularization and growing abstraction starting in the early nineteenth century that might help to nuance and deepen insights developed in environmental history.

  • 40.
    Boyer de la Giroday, Anna
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerad datorsystem.
    Automatic fine tuning of cavity filters2016Självständigt arbete på avancerad nivå (masterexamen), 20 poäng / 30 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Cavity filters are a necessary component in base stations used for telecommunication. Without these filters it would not be possible for base stations to send and receive signals at the same time. Today these cavity filters require fine tuning by humans before they can be deployed. This thesis have designed and implemented a neural network that can tune cavity filters. Different types of design parameters have been evaluated, such as neural network architecture, data presentation and data preprocessing. While the results was not comparable to human fine tuning, it was shown that there was a relationship between error and number of weights in the neural network. The thesis also presents some rules of thumb for future designs of neural network used for filter tuning.

    Ladda ner fulltext (pdf)
    fulltext
  • 41.
    Braun, Marc
    et al.
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten. University of Stuttgart, Fraunhofer IPA.
    Kunz, Jenny
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    A Hypothesis-Driven Framework for the Analysis of Self-Rationalising Models2024Konferensbidrag (Refereegranskat)
  • 42.
    Bränd, Stefan
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerad datorsystem.
    Using Rigid Landmarks to Infer Inter-Temporal Spatial Relations in Spatio-Temporal Reasoning2015Självständigt arbete på grundnivå (kandidatexamen), 10 poäng / 15 hpStudentuppsats (Examensarbete)
    Abstract [en]

    Spatio-temporal reasoning is the area of automated reasoning about space and time and is important in the field of robotics. It is desirable for an autonomous robot to have the ability to reason about both time and space. ST0 is a logic that allows for such reasoning by, among other things, defining a formalism used to describe the relationship between spatial regions and a calculus that allows for deducing further information regarding such spatial relations. An extension of ST0 is ST1 that can be used to describe the relationship between spatial entities across time-points (inter-temporal relations) while ST0 is constrained to doing so within a single time-point. This allows for a better ability of expressing how spatial entities change over time. A major obstacle in using ST1 in practise however, is the fact that any observations made regarding spatial relations between regions is constrained to the time-point in which the observation was made, so we are unable to observe inter-temporal relations. Further complicating things is the fact that deducing such inter-temporal relations is not possible without a frame of reference. This thesis examines one method of overcoming these problems by considering the concept of rigid regions which are assumed to always be unchanging and using them as the frame of reference, or as landmarks. The effectiveness of this method is studied by conducting experiments where a comparison is made between various landmark ratios with respect to the total number of regions under consideration. Results show that when a high degree of intra-temporal relations are fully or partially known, increasing the number of landmark regions will reduce the percentage of inter-temporal relations to be completely unknown. Despite this, very few inter-temporal relations can be fully determined even with a high ratio of landmark regions.

    Ladda ner fulltext (pdf)
    fulltext
  • 43.
    Burdakov, Oleg
    et al.
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Kvarnström, Jonas
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Local Search for Hop-constrained Directed Steiner Tree Problem with Application to UAV-based Multi-target Surveillance2014Rapport (Övrigt vetenskapligt)
    Abstract [en]

    We consider the directed Steiner tree problem (DSTP) with a constraint on the total number of arcs (hops) in the tree. This problem is known to be NP-hard, and therefore, only heuristics can be applied in the case of its large-scale instances.   For the hop-constrained DSTP, we propose local search strategies aimed at improving any heuristically produced initial Steiner tree. They are based on solving a sequence of hop-constrained shortest path problems for which we have recently developed ecient label correcting algorithms.   The presented approach is applied to nding suitable 3D locations where unmanned aerial vehicles (UAVs) can be placed to relay information gathered in multi-target monitoring and surveillance. The eciency of our algorithms is illustrated by results of numerical experiments involving problem instances with up to 40 000 nodes and up to 20 million arcs.

    Ladda ner fulltext (pdf)
    Local Search for Hop-constrained Directed Steiner Tree Problem with Application to UAV-based Multi-target Surveillance
  • 44.
    Burdakov, Oleg
    et al.
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Kvarnström, Jonas
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Local Search for Hop-constrained Directed Steiner Tree Problem with Application to UAV-based Multi-target Surveillance2014Ingår i: Examining Robustness and Vulnerability of Networked Systems / [ed] Butenko, S., Pasiliao, E.L., Shylo, V., IOS Press, 2014, s. 26-50Konferensbidrag (Refereegranskat)
    Abstract [en]

    We consider the directed Steiner tree problem (DSTP) with a constraint on the total number of arcs (hops) in the tree. This problem is known to be NP-hard, and therefore, only heuristics can be applied in the case of its large-scale instances.For the hop-constrained DSTP, we propose local search strategies aimed at improving any heuristically produced initial Steiner tree. They are based on solving a sequence of hop-constrained shortest path problems for which we have recently developed efficient label correcting algorithms.The presented approach is applied to finding suitable 3D locations where unmanned aerial vehicles (UAVs) can be placed to relay information gathered in multi-target monitoring and surveillance. The efficiency of our algorithms is illustrated by results of numerical experiments involving problem instances with up to 40 000 nodes and up to 20 million arcs.

    Ladda ner fulltext (pdf)
    Local Search for Hop-constrained Directed Steiner Tree Problem with Application to UAV-based Multi-target Surveillance
  • 45.
    Burdakov, Oleg
    et al.
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska högskolan.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Kvarnström, Jonas
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan.
    Optimal Scheduling for Replacing Perimeter Guarding Unmanned Aerial Vehicles2014Rapport (Övrigt vetenskapligt)
    Abstract [en]

    Guarding the perimeter of an area in order to detect potential intruders is an important task in a variety of security-related applications. This task can in many circumstances be performed by a set of camera-equipped unmanned aerial vehicles (UAVs). Such UAVs will occasionally require refueling or recharging, in which case they must temporarily be replaced by other UAVs in order to maintain complete surveillance of the perimeter. In this paper we consider the problem of scheduling such replacements. We present optimal replacement strategies and justify their optimality.

    Ladda ner fulltext (pdf)
    Optimal Scheduling for Replacing Perimeter Guarding Unmanned Aerial Vehicles
  • 46.
    Burdakov, Oleg
    et al.
    Linköpings universitet, Matematiska institutionen, Optimeringslära. Linköpings universitet, Tekniska fakulteten.
    Kvarnström, Jonas
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Doherty, Patrick
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Optimal scheduling for replacing perimeter guarding unmanned aerial vehicles2017Ingår i: Annals of Operations Research, ISSN 0254-5330, E-ISSN 1572-9338, Vol. 249, nr 1, s. 163-174Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    Guarding the perimeter of an area in order to detect potential intruders is an important task in a variety of security-related applications. This task can in many circumstances be performed by a set of camera-equipped unmanned aerial vehicles (UAVs). Such UAVs will occasionally require refueling or recharging, in which case they must temporarily be replaced by other UAVs in order to maintain complete surveillance of the perimeter. In this paper we consider the problem of scheduling such replacements. We present optimal replacement strategies and justify their optimality.

    Ladda ner fulltext (pdf)
    fulltext
  • 47.
    Cao, Son Thanh
    et al.
    Vinh University, Nghe An, Vietnam .
    Nguyen, Linh Anh
    University of Warsaw, Poland; VNU University of Engineering and Technology, Hanoi, Vietnam.
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan. University of Warsaw, Poland.
    WORL: a nonmonotonic rule language for the semantic web2014Ingår i: Vietnam Journal of Computer Science, ISSN 2196-8888, Vol. 1, nr 1, s. 57-69Artikel i tidskrift (Refereegranskat)
    Abstract [en]

    We develop a new Web ontology rule language, called WORL, which combines a variant of OWL 2 RL with eDatalog ¬ . We allow additional features like negation, the minimal number restriction and unary external checkable predicates to occur at the left-hand side of concept inclusion axioms. Some restrictions are adopted to guarantee a translation into eDatalog ¬ . We also develop the well-founded semantics and the stable model semantics for WORL as well as the standard semantics for stratified WORL (SWORL) via translation into eDatalog ¬ . Both WORL with respect to the well-founded semantics and SWORL with respect to the standard semantics have PTime data complexity. In contrast to the existing combined formalisms, in WORL and SWORL negation in concept inclusion axioms is interpreted using nonmonotonic semantics.

  • 48.
    Cao, S.T.
    et al.
    Faculty of Information Technology, Vinh University, 182 Le Duan street, Vinh Nghe An, Viet Nam; Institute of Informatics, University of of Warsaw, Banacha 2, 02-097 Warsaw, Poland.
    Nguyen, L.A.
    Institute of Informatics, University of of Warsaw, Banacha 2, 02-097 Warsaw, Poland; Faculty of Information Technology, VNU University of of Engineering and Technology, 144 Xuan Thuy, Hanoi, Viet Nam.
    Szalas, Andrzej
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska högskolan. Institute of Informatics, University of of Warsaw, Banacha 2, 02-097 Warsaw, Poland.
    The web ontology rule language OWL 2 RL+ and its extensions2014Ingår i: Transactions on Computational Collective Intelligence XIII / [ed] Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen, Springer Verlag (Germany) , 2014, Vol. 8342, s. 152-175Konferensbidrag (Refereegranskat)
    Abstract [en]

    It is known that the OWL 2RL Web Ontology Language Profile has PTime data complexity and can be translated into Datalog. However, the result of translation may consist of a Datalog program and a set of constraints in the form of negative clauses. Therefore, a knowledge base in OWL 2RL may be unsatisfiable. In the current paper we first identify a maximal fragment of OWL 2RL, called OWL 2RL+, with the property that every knowledge base expressed in OWL2RL+ can be translated to a Datalog program and hence is satisfiable. We then propose some extensions of OWL 2RL and OWL 2RL + that still have PTime data complexity. © 2014 Springer-Verlag Berlin Heidelberg.

  • 49.
    Carlsen, Henrik
    et al.
    Stockholm Environm Inst, Sweden.
    Nykvist, Bjorn
    Stockholm Environm Inst, Sweden.
    Joshi, Somya
    Stockholm Environm Inst, Sweden.
    Heintz, Fredrik
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Chasing artificial intelligence in shared socioeconomic pathways2024Ingår i: One Earth, ISSN 2590-3330, E-ISSN 2590-3322, Vol. 7, nr 1, s. 18-22Artikel i tidskrift (Övrigt vetenskapligt)
    Abstract [en]

    The development of artificial intelligence has likely reached an inflection point, with significant implications for how research needs to address emerging technologies and how they drive long-term socioeconomic development of importance for climate change scenarios.

  • 50.
    Christen, Remo
    et al.
    University of Basel.
    Eriksson, Salomé
    University of Basel.
    Katz, Michael
    IBM T.J. Watson Research Center.
    Muise, Christian
    Queen’s University.
    Petrov, Alice
    Queen’s University.
    Pommerening, Florian
    University of Basel.
    Seipp, Jendrik
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    Sievers, Silvan
    University of Basel.
    Speck, David
    Linköpings universitet, Institutionen för datavetenskap, Artificiell intelligens och integrerade datorsystem. Linköpings universitet, Tekniska fakulteten.
    PARIS: Planning Algorithms for Reconfiguring Independent Sets2023Ingår i: Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023), 2023, Vol. 26, s. 453-460Konferensbidrag (Refereegranskat)
    Abstract [en]

    Combinatorial reconfiguration is the problem of transforming one solution of a combinatorial problem into another, where each transformation may only apply small changes to a solution and may not leave the solution space. An important example is the independent set reconfiguration (ISR) problem, where an independent set of a graph (a subset of its vertices without edges between them) has to be transformed into another by a sequence of transformations that can replace a vertex in the current subset such that the new subset is still an independent set. The 1st Combinatorial Reconfiguration Challenge (CoRe Challenge 2022) was a competition focused on the ISR problem. The PARIS team successfully participated with two solvers that model the ISR problem as a planning task and employ different planning techniques for solving it. In this work, we describe these models and solvers. For a fair comparison to competing ISR approaches, we re-run the entire competition under equal computational conditions. Besides showcasing the success of planning technology, we hope that this work will create a cross-fertilization of the two research fields.

1234567 1 - 50 av 372
RefereraExporteraLänk till träfflistan
Permanent länk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf