Search or filter publications

Filter by type:

Filter by publication type

Filter by year:



  • Showing results for:
  • Reset all filters

Search results

  • Conference paper
    Athakravi D, Satoh K, Law M, Broda K, Russo AMet al., 2015,

    Automated inference of rules with exception from past legal cases using ASP

    , International Conference on Logic Programming and Non Monotonic Reasoning (LPNMR 2015), Publisher: Springer, Pages: 83-96, ISSN: 0302-9743

    In legal reasoning, different assumptions are often considered when reaching a final verdict and judgement outcomes strictly depend on these assumptions. In this paper, we propose an approach for generating a declarative model of judgements from past legal cases, that expresses a legal reasoning structure in terms of principle rules and exceptions. Using a logic-based reasoning technique, we are able to identify from given past cases different underlying defaults (legal assumptions) and compute judgements that (i) cover all possible cases (including past cases) within a given set of relevant factors, and (ii) can make deterministic predictions on final verdicts for unseen cases. The extracted declarative model of judgements can then be used to make automated inference of future judgements, and generate explanations of legal decisions.

  • Journal article
    Law M, Russo A, Broda K, 2015,

    Learning weak constraints in answer set programming

    , Theory and Practice of Logic Programming, Vol: 15, Pages: 511-525, ISSN: 1475-3081

    This paper contributes to the area of inductive logic programming by presenting a new learning framework that allows the learning of weak constraints in Answer Set Programming (ASP). The framework, called Learning from Ordered Answer Sets, generalises our previous work on learning ASP programs without weak constraints, by considering a new notion of examples as ordered pairs of partial answer sets that exemplify which answer sets of a learned hypothesis (together with a given background knowledge) are preferred to others. In this new learning task inductive solutions are searched within a hypothesis space of normal rules, choice rules, and hard and weak constraints. We propose a new algorithm, ILASP2, which is sound and complete with respect to our new learning framework. We investigate its applicability to learning preferences in an interview scheduling problem and also demonstrate that when restricted to the task of learning ASP programs without weak constraints, ILASP2 can be much more efficient than our previously proposed system.

  • Conference paper
    Kormushev P, Demiris Y, Caldwell DG, 2015,

    Kinematic-free Position Control of a 2-DOF Planar Robot Arm

  • Conference paper
    Kryczka P, Kormushev P, Tsagarakis N, Caldwell DGet al., 2015,

    Online Regeneration of Bipedal Walking Gait Optimizing Footstep Placement and Timing

  • Journal article
    Carrera A, Palomeras N, Hurtós N, Kormushev P, Carreras Met al., 2015,

    Cognitive System for Autonomous Underwater Intervention

    , Pattern Recognition Letters, ISSN: 0167-8655
  • Journal article
    Cully A, Clune J, Tarapore D, Mouret J-Bet al., 2015,

    Robots that can adapt like animals

    , Nature, Vol: 521, Pages: 503-507, ISSN: 0028-0836

    As robots leave the controlled environments of factories to autonomouslyfunction in more complex, natural environments, they will have to respond tothe inevitable fact that they will become damaged. However, while animals canquickly adapt to a wide variety of injuries, current robots cannot "thinkoutside the box" to find a compensatory behavior when damaged: they are limitedto their pre-specified self-sensing abilities, can diagnose only anticipatedfailure modes, and require a pre-programmed contingency plan for every type ofpotential damage, an impracticality for complex robots. Here we introduce anintelligent trial and error algorithm that allows robots to adapt to damage inless than two minutes, without requiring self-diagnosis or pre-specifiedcontingency plans. Before deployment, a robot exploits a novel algorithm tocreate a detailed map of the space of high-performing behaviors: This maprepresents the robot's intuitions about what behaviors it can perform and theirvalue. If the robot is damaged, it uses these intuitions to guide atrial-and-error learning algorithm that conducts intelligent experiments torapidly discover a compensatory behavior that works in spite of the damage.Experiments reveal successful adaptations for a legged robot injured in fivedifferent ways, including damaged, broken, and missing legs, and for a roboticarm with joints broken in 14 different ways. This new technique will enablemore robust, effective, autonomous robots, and suggests principles that animalsmay use to adapt to injury.

  • Conference paper
    Ahmadzadeh SR, Paikan A, Mastrogiovanni F, Natale L, Kormushev P, Caldwell DGet al., 2015,

    Learning Symbolic Representations of Actions from Human Demonstrations

  • Conference paper
    Kormushev P, Demiris Y, Caldwell DG, 2015,

    Encoderless Position Control of a Two-Link Robot Manipulator

  • Conference paper
    Jamali N, Kormushev P, Carrera A, Carreras M, Caldwell DGet al., 2015,

    Underwater Robot-Object Contact Perception using Machine Learning on Force/Torque Sensor Feedback

  • Conference paper
    Carrera A, Palomeras N, Hurtos N, Kormushev P, Carreras Met al., 2015,

    Learning multiple strategies to perform a valve turning with underwater currents using an I-AUV

  • Conference paper
    Jamisola RS, Kormushev P, Caldwell DG, Ibikunle Fet al., 2015,

    Modular Relative Jacobian for Dual-Arms and the Wrench Transformation Matrix

  • Conference paper
    Lane DM, Maurelli F, Kormushev P, Carreras M, Fox M, Kyriakopoulos Ket al., 2015,

    PANDORA - Persistent Autonomy through Learning, Adaptation, Observation and Replanning

  • Conference paper
    Athakravi D, Alrajeh D, Broda K, Russo A, Satoh Ket al., 2015,

    Inductive Learning Using Constraint-Driven Bias

    , 24th International Conference on Inductive Logic Programming (ILP), Publisher: SPRINGER-VERLAG BERLIN, Pages: 16-32, ISSN: 0302-9743
  • Journal article
    Takano W, Asfour T, Kormushev P, 2015,

    Special Issue on Humanoid Robotics

    , Advanced Robotics, Vol: 29
  • Journal article
    Bimbo J, Kormushev P, Althoefer K, Liu Het al., 2015,

    Global Estimation of an Object’s Pose Using Tactile Sensing

    , Advanced Robotics, Vol: 29
  • Conference paper
    Ahmadzadeh SR, Kormushev P, Caldwell DG, 2014,

    Multi-Objective Reinforcement Learning for AUV Thruster Failure Recovery

  • Conference paper
    Dallali H, Kormushev P, Tsagarakis N, Caldwell DGet al., 2014,

    Can Active Impedance Protect Robots from Landing Impact?

  • Conference paper
    Ahmadzadeh SR, Jamisola RS, Kormushev P, Caldwell DGet al., 2014,

    Learning Reactive Robot Behavior for Autonomous Valve Turning

  • Journal article
    Kadir SN, Goodman DFM, Harris KD, 2014,

    High-Dimensional Cluster Analysis with the Masked EM Algorithm

    , Neural Computation, Vol: 26, Pages: 2379-2394, ISSN: 0899-7667

    Cluster analysis faces two problems in high dimensions: the "curse of dimensionality" that can lead to overfitting and poor generalization performance and the sheer time taken for conventional algorithms to process large amounts of high-dimensional data. We describe a solution to these problems, designed for the application of spike sorting for nextgeneration, high-channel-count neural probes. In this problem, only a small subset of features provides information about the cluster membership of any one data vector, but this informative feature subset is not the same for all data points, rendering classical feature selection ineffective.We introduce a "masked EM" algorithm that allows accurate and time-efficient clustering of up to millions of points in thousands of dimensions. We demonstrate its applicability to synthetic data and to real-world high-channel-count spike sorting data.

  • Conference paper
    Jamisola RS, Kormushev P, Bicchi A, Caldwell DGet al., 2014,

    Haptic Exploration of Unknown Surfaces with Discontinuities

This data is extracted from the Web of Science and reproduced under a licence from Thomson Reuters. You may not copy or re-distribute this data in whole or in part without the written consent of the Science business of Thomson Reuters.

Request URL: Request URI: /respub/WEB-INF/jsp/search-t4-html.jsp Query String: id=989&limit=20&page=7&respub-action=search.html Current Millis: 1594609951183 Current Time: Mon Jul 13 04:12:31 BST 2020