AustinDeric

rostopic echo /follow_joint_trajectory/goal
header: 
  seq: 9
  stamp: 
    secs: 1540831982
    nsecs: 840345239
  frame_id: ''
goal_id: 
  stamp: 
    secs: 1540831982

AustinDeric

 rostopic echo /move_group/goal
header: 
  seq: 16
  stamp: 
    secs: 1540832122
    nsecs: 268742089
  frame_id: ''
goal_id: 
  stamp: 
    secs: 1540832122

AustinDeric

- git:
    local-name: turtlebot3
    uri: https://github.com/ROBOTIS-GIT/turtlebot3
    version: kinetic-devel
- git:
    local-name: turtlebot3_msgs
    uri: https://github.com/ROBOTIS-GIT/turtlebot3_msgs
    version: kinetic-devel
- git:
    local-name: turtlebot3_simulations

AustinDeric

- git:
    local-name: turtlebot3
    uri: https://github.com/ROBOTIS-GIT/turtlebot3
    version: melodic-devel
- git:
    local-name: turtlebot3_msgs
    uri: https://github.com/ROBOTIS-GIT/turtlebot3_msgs
    version: melodic-devel
- git:
    local-name: turtlebot3_simulations

AustinDeric

- git:
    local-name: catkin_simple
    uri: https://github.com/catkin/catkin_simple
    version: master
- git:
    local-name: hector_gazebo
    uri: https://github.com/tu-darmstadt-ros-pkg/hector_gazebo
    version: kinetic-devel
- git:
    local-name: realtime_tools

AustinDeric

- git:
    local-name: catkin_simple
    uri: https://github.com/catkin/catkin_simple
    version: master
- git:
    local-name: hector_gazebo
    uri: https://github.com/tu-darmstadt-ros-pkg/hector_gazebo
    version: kinetic-devel
- git:
    local-name: realtime_tools

AustinDeric

// Compiled with: g++ -Wall -std=c++14 -pthread
/*
Shortest path on a grid
1. In robotics, a robot often to find a plan (a path or a set of actions) to reach its goal. Write code to determine the shortest path on a grid. Where the grid is square with the length of side N = 10.  In one step the robot is only allowed to move to a cell adjacent to its current cell, i.e., robot can move up, down, left, right (not diagonally).  The robot can start at a point (0,0) and its goal location (7,9) assuming the row and column values are indexed starting at 0. Your output is to print the sequence of cells that the robot will visit. You can print the row, col value for each cell that the robot visits on its way to the goal.
Bonus Question: Now lets say someone placed an obstacle at (6,7) and (2,2). An obstacle means that the robot can no longer go through that cell. How will your solution change? Implement your solution and print the path.
Objective: Write a function "findShortestPath(const int N, const int startx, const i

AustinDeric

#include <iostream>
#include <string>
#include <vector>

//method: parse the string and create a vector of numbers and operators then iterate that vector to create the value
int main(){
    std::string str_val = "3*5+11+5*20+9*2*4+135";
    std::vector<std::string> expression;
    std::string number_holder;
    int position = 0;

AustinDeric

Deploying Keycloak to AWS

The objective of this guide is to deploy Keycloak to AWS in a minimally complex way for testing and discovery purposes. This means using the standalone build of Keycloak backed with Hibernate H2. The result is not a production ready system. It won't scale, it won't survive significant load, it can't be clustered.

Mostly this Gist is a distillation of the Keycloak Server Installation guide for a specific use case: to spin up a quick and dirty Keycloak instance for testing and experimenting.

Steps

• Spin up and configure a Ubuntu AMI
• Install and configure Keycloak with an SSL cert

AustinDeric

import React, { Component } from 'react';
import {Viewer, Grid, UrdfClient} from 'ros3d';
import ROSLIB from 'roslib';

export default class Simulator extends Component {

    constructor(props) {
        super(props);
    }