• 検索結果がありません。

sig sai26 10 Recent site activity jsaisigsai

N/A
N/A
Protected

Academic year: 2018

シェア "sig sai26 10 Recent site activity jsaisigsai"

Copied!
1
0
0

読み込み中.... (全文を見る)

全文

(1)

Environments and Tools

 Gazebo

Gazebo is 3D virtual model simulator for robot that operates by ROS.

 Caffe

Caffe is one of the deep learning frameworks that is being developed as an open source.

Evaluation Methods

 Error Function

Represent the closeness measure of function with a training data.

・Cross Entropy

� = − ∑ ∑ ������ ;

�=�

�=�

 Stochastic gradient descent

Repeatedly update the weights and biases.

�� ≡ = [ ]

�+� = − ��

Results and Evaluation

 Number of trials with loss function

 Result model structure

Example Image Results

Future works and Conclusion.

Classification Driving State using

Convolution Neural Network

Wasin Hawaree (福井工業大学),松永尭 (福井工業大学),信川創 (福井工業大学)

 Background and Purpose

RoboCup Rescue Virtual Robot League (RCRL) in this competition to

perform the robot on a 3D space modeling in the disaster area and discovered

the location of victims. In this study, we consider driving state of the robot

with a convolution neural network.

 Consider about classification of the complex images.

 Furthermore, in obstacle not just the path and wall.

 Study more about algorithm techniques.

参照

関連したドキュメント

We present sufficient conditions for the existence of solutions to Neu- mann and periodic boundary-value problems for some class of quasilinear ordinary differential equations.. We

In Section 13, we discuss flagged Schur polynomials, vexillary and dominant permutations, and give a simple formula for the polynomials D w , for 312-avoiding permutations.. In

Analogs of this theorem were proved by Roitberg for nonregular elliptic boundary- value problems and for general elliptic systems of differential equations, the mod- ified scale of

Later, in [1], the research proceeded with the asymptotic behavior of solutions of the incompressible 2D Euler equations on a bounded domain with a finite num- ber of holes,

Then it follows immediately from a suitable version of “Hensel’s Lemma” [cf., e.g., the argument of [4], Lemma 2.1] that S may be obtained, as the notation suggests, as the m A

Correspondingly, the limiting sequence of metric spaces has a surpris- ingly simple description as a collection of random real trees (given below) in which certain pairs of

[Mag3] , Painlev´ e-type differential equations for the recurrence coefficients of semi- classical orthogonal polynomials, J. Zaslavsky , Asymptotic expansions of ratios of

Some of the above approximation algorithms for the MSC include a proce- dure for partitioning a minimum spanning tree T ∗ of a given graph into k trees of the graph as uniformly