Performance analysis and tuning are well established software engineering processes in the realm of imperative programming. this work is a step towards establishing the standards of performance analysis in the realm o...
详细信息
this paper presents a new framework for generating test-case scenarios for autonomous vehicles. We address two challenges in automatic test-case generation: first, a formal notion of test-case complexity, and second, ...
详细信息
ISBN:
(纸本)9781665409674
this paper presents a new framework for generating test-case scenarios for autonomous vehicles. We address two challenges in automatic test-case generation: first, a formal notion of test-case complexity, and second, an algorithm to generate more-complex test-cases. We characterize the complexity of a test-case by its set of solutions, and compare two complexities by the subset relation. the novelty of our definition is that it only relies on the pass-fail criteria of the test-case, rather than indirect or subjective assessments of what may challenge an ego vehicle to pass a test-case. Given a testcase, we model the problem of generating a more complex test-case as a constraint-satisfaction search problem. the search variables are the changes to the given test-case, and the search constraints define a solution to the search problem. the constraints include steering geometry of cars, the geometry of lanes, the shape of cars, traffic rules, bounds on longitudinal acceleration of cars, etc. To conquer the computational challenge, we divide the constraints to three categories and satisfy them with simulation, answer set programming, and SMT solving. We have implemented our algorithm using the Scenic libraries and the CARLA simulator and generate test-cases for several 3-way and 4-way intersections with different topologies. Our experiments demonstrate that both CARLA's autopilot and autopilot-plus-RSS (Responsibility-Sensitive Safety) can fail as the complexity of test-cases increase.
We present an algorithm, CDCL-AMS, for solving Modular Systems consisting of a set of modules where, for each module, we have a simple "black-box" solver. the algorithm is based on the Conflict- Directed Cla...
详细信息
We consider the problem of learning Boltzmann machine classifiers from relational data. Our goal is to extend the deep belief framework of RBMs to statistical relational models. this allows one to exploit the feature ...
详细信息
ISBN:
(数字)9783319780900
ISBN:
(纸本)9783319780900;9783319780894
We consider the problem of learning Boltzmann machine classifiers from relational data. Our goal is to extend the deep belief framework of RBMs to statistical relational models. this allows one to exploit the feature hierarchies and the non-linearity inherent in RBMs over the rich representations used in statistical relational learning (SRL). Specifically, we use lifted random walks to generate features for predicates that are then used to construct the observed features in the RBM in a manner similar to Markov logic Networks. We show empirically that this method of constructing an RBM is comparable or better than the state-of-the-art probabilistic relational learning algorithms on six relational domains.
Where do the predicates in a game ontology come from? We use RGBD vision to learn a) the spatial structure of a board, and b) the number of parameters in a move or transition. these are used to define state-transition...
详细信息
ISBN:
(纸本)9783319161815;9783319161808
Where do the predicates in a game ontology come from? We use RGBD vision to learn a) the spatial structure of a board, and b) the number of parameters in a move or transition. these are used to define state-transition predicates for a logical description of each game state. Given a set of videos for a game, we use an improved 3D multi-object tracking to obtain the positions of each piece in games such as 4-peg solitaire or Towers of Hanoi. the spatial positions occupied by pieces over the entire game is clustered, revealing the structure of the board. Each frame is represented as a Semantic Graph with edges encoding spatial relations between pieces. Changes in the graphs between game states reveal the structure of a "move". Knowledge from spatial structure and semantic graphs is mapped to FOL descriptions of the moves and used in an inductivelogic framework to infer the valid moves and other rules of the game. Discovered predicate structures and induced rules are demonstrated for several games with varying board layouts and move structures.
the FasTraC system provides all facilities to design and validate a decentralized traffic control system for a urban network. Each signal is controlled by an independent control unit. the behavior of the control units...
详细信息
A tableau calculus for a logic with constructive negation and an implementation of the related decision procedure is presented. this logic is an extension of Nelson logic and it has been used in the framework of progr...
详细信息
ISBN:
(纸本)3540230246
A tableau calculus for a logic with constructive negation and an implementation of the related decision procedure is presented. this logic is an extension of Nelson logic and it has been used in the framework of program verification and timing analysis of combinatorial circuits. the decision procedure is tailored to shrink the search space of proofs and it is proved correct by using a semantical technique. It has been implemented in C++ language.
the proceedings contain 13 papers. the special focus in this conference is on Coalgebraic Methods in Computer Science. the topics include: Fixed points of functors;compositional coinduction with sized types;lawvere ca...
ISBN:
(纸本)9783319403694
the proceedings contain 13 papers. the special focus in this conference is on Coalgebraic Methods in Computer Science. the topics include: Fixed points of functors;compositional coinduction with sized types;lawvere categories as composed props;transitivity and difunctionality of bisimulations;affine monads and side-effect-freeness;duality of equations and coequations via contravariant adjunctions;category theoretic semantics for theorem proving in logicprogramming;product rules and distributive laws;on the logic of generalised metric spaces;a complete logic for behavioural equivalence in coalgebras of finitary set functors;coalgebraic completeness-via-canonicity;relational lattices via duality and on local characterization of global timed bisimulation for abstract continuous-time systems.
We propose an exact optimization method for home hospice care staffing and scheduling, using logic-based Benders decomposition (LBBD). the objective is to match hospice care aides with patients and schedule visits to ...
详细信息
ISBN:
(数字)9783319339542
ISBN:
(纸本)9783319339542;9783319339535
We propose an exact optimization method for home hospice care staffing and scheduling, using logic-based Benders decomposition (LBBD). the objective is to match hospice care aides with patients and schedule visits to patient homes, so as to maximize the number of patients serviced by available staff, while meeting requirements of the patient plan of care and scheduling constraints imposed by the patients and the staff. the Benders master problem assigns aides to patients and days of the week and is solved by mixed integer programming (MIP). the routing and scheduling subproblem decouples by aide and day of the week and is solved by constraint programming. We report preliminary computational results for problem instances obtained from a major hospice care provider. We find that LBBD is superior to state-of-the-art MIP and solves problems of realistic size, if the aim is to conduct staff planning on a rolling basis while maintaining continuity of the care arrangement for patients currently receiving service.
Relational instance-based learning (RIBL) algorithms offer high prediction capabilities. However, they do not scale up well, specially in domains where there is a time bound for classification. Nearest prototype appro...
详细信息
暂无评论